Context-free grammars with regular conditions

Emil Navrátil

Kybernetika (1970)

  • Volume: 06, Issue: 2, page (118)-126
  • ISSN: 0023-5954

How to cite

top

Navrátil, Emil. "Context-free grammars with regular conditions." Kybernetika 06.2 (1970): (118)-126. <http://eudml.org/doc/28060>.

@article{Navrátil1970,
author = {Navrátil, Emil},
journal = {Kybernetika},
language = {eng},
number = {2},
pages = {(118)-126},
publisher = {Institute of Information Theory and Automation AS CR},
title = {Context-free grammars with regular conditions},
url = {http://eudml.org/doc/28060},
volume = {06},
year = {1970},
}

TY - JOUR
AU - Navrátil, Emil
TI - Context-free grammars with regular conditions
JO - Kybernetika
PY - 1970
PB - Institute of Information Theory and Automation AS CR
VL - 06
IS - 2
SP - (118)
EP - 126
LA - eng
UR - http://eudml.org/doc/28060
ER -

References

top
  1. K. Čulík, Mathematical theory of languages, (To appear.) 
  2. S. Ginsburg, S. Greibach, Mappings which preserve context-sensitive languages, Inf. and Control. 9 (1966), 563-582. (1966) Zbl0145.00803MR0205769
  3. S. Ginsburg, The mathematical theory of context-free languages, McGraw-Hill, 1966. (1966) Zbl0184.28401MR0211815
  4. I. Friš, Grammars with partial ordering of rules, Inf. and Control, 12 (1968), 415-425. (1968) MR0243952

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

                
Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.