Acceptors and generalized -grammars

Jan Ostravský

Archivum Mathematicum (1982)

  • Volume: 018, Issue: 3, page 151-162
  • ISSN: 0044-8753

How to cite

top

Ostravský, Jan. "Acceptors and generalized $lc$-grammars." Archivum Mathematicum 018.3 (1982): 151-162. <http://eudml.org/doc/18089>.

@article{Ostravský1982,
author = {Ostravský, Jan},
journal = {Archivum Mathematicum},
keywords = {generalized labelled contextual grammars; infinite language generators; acceptors; Pawlak machines},
language = {eng},
number = {3},
pages = {151-162},
publisher = {Department of Mathematics, Faculty of Science of Masaryk University, Brno},
title = {Acceptors and generalized $lc$-grammars},
url = {http://eudml.org/doc/18089},
volume = {018},
year = {1982},
}

TY - JOUR
AU - Ostravský, Jan
TI - Acceptors and generalized $lc$-grammars
JO - Archivum Mathematicum
PY - 1982
PB - Department of Mathematics, Faculty of Science of Masaryk University, Brno
VL - 018
IS - 3
SP - 151
EP - 162
LA - eng
KW - generalized labelled contextual grammars; infinite language generators; acceptors; Pawlak machines
UR - http://eudml.org/doc/18089
ER -

References

top
  1. Marcus S., Contextual grammars, Rev. Roum. Math. Puгes et Appl. 14 (1969), 1525-1934. (1969) Zbl0193.32401MR0262026
  2. Novotný M., On a class of contextual grammars, Cahieгs de linguistique théorique et appliquée 11 (1974), Fasc. 2, 313-314. (1974) 
  3. Novotný M., On muiticontextual grammars, (manuscгipt). 
  4. Novotný M., On some variants of contextual languages, Rеv. Roum. Math. Purеs еt Appl. 21 (1976), 1053-1062. (1976) MR0428829
  5. Novotný M., Each generalized contextual language is context sensitive, Rеv. Roum. Math. Purеs еt Appl. 21 (1976), 353-362. (1976) Zbl0333.68048MR0405943
  6. Ginsburg S., The mathematical theory of context-free languages, Mc Graw Hill Book Company Nеw York, 1966. (1966) Zbl0184.28401MR0211815
  7. Pawlak Z., Maszyny programowane, Algorytmy 10, volumе 5, 1969, 5-19. (1969) MR0255104
  8. Čulík K., Some notes on finite state languages and events represented by finite automata using labelled graphs, Čas. pěst. mat, 86, 43-55 (1961). (1961) MR0130062
  9. Marcus S., Gramatici şi automate finite, Editura acadеmiеi rеpublicii popularе Rominе, 1964. (1964) MR0174411
  10. Păun G., On the smallest number of nonterminals required to generate a context-free language, Rеv. Anal. Numér. Théor. Approx. 18 (41), t. 2 (1976), 203-208. (1976) MR0489052
  11. Gruska J., On a classification of context-free languages, Kybеrnеtika (Praguе) 3, Nr. 1 (1967), 22-29. (1967) Zbl0158.25401MR0209092
  12. Gruska J., Descriptional complexity of context-free languages, Mathеmatical Foundations of Computеr Sciеncе. Procееdings of Symposium and Summеr School. High Tatras, Sеptеmbег 3 to 8, 1973 (1973), 71-83. (1973) MR0405938

NotesEmbed ?

top

You must be logged in to post comments.