Geodesic
Acceptors and generalized $lc$-grammars
Archivum mathematicum, Tome 18 (1982) no. 3, pp. 151-162 Cet article a éte moissonné depuis la source Czech Digital Mathematics Library

Voir la notice de l'article

Classification : 68Q45 
@article{ARM_1982_18_3_a5,
     author = {Ostravsk\'y, Jan},
     title = {Acceptors and generalized $lc$-grammars},
     journal = {Archivum mathematicum},
     pages = {151--162},
     year = {1982},
     volume = {18},
     number = {3},
     mrnumber = {682103},
     zbl = {0518.68044},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/ARM_1982_18_3_a5/}
}
TY  - JOUR
AU  - Ostravský, Jan
TI  - Acceptors and generalized $lc$-grammars
JO  - Archivum mathematicum
PY  - 1982
SP  - 151
EP  - 162
VL  - 18
IS  - 3
UR  - http://geodesic.mathdoc.fr/item/ARM_1982_18_3_a5/
LA  - en
ID  - ARM_1982_18_3_a5
ER  - 
%0 Journal Article
%A Ostravský, Jan
%T Acceptors and generalized $lc$-grammars
%J Archivum mathematicum
%D 1982
%P 151-162
%V 18
%N 3
%U http://geodesic.mathdoc.fr/item/ARM_1982_18_3_a5/
%G en
%F ARM_1982_18_3_a5
Ostravský, Jan. Acceptors and generalized $lc$-grammars. Archivum mathematicum, Tome 18 (1982) no. 3, pp. 151-162. http://geodesic.mathdoc.fr/item/ARM_1982_18_3_a5/

[1] Marcus S.: Contextual grammars. Rev. Roum. Math. Puгes et Appl. 14 (1969), 1525-1934. | MR | Zbl

[2] Novotný M.: On a class of contextual grammars. Cahieгs de linguistique théorique et appliquée 11 (1974), Fasc. 2, 313-314.

[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. | MR

[5] Novotný M.: Each generalized contextual language is context sensitive. Rеv. Roum. Math. Purеs еt Appl. 21 (1976), 353-362. | MR | Zbl

[6] Ginsburg S.: The mathematical theory of context-free languages. Mc Graw Hill Book Company Nеw York, 1966. | MR | Zbl

[7] Pawlak Z.: Maszyny programowane. Algorytmy 10, volumе 5, 1969, 5-19. | MR

[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). | MR

[9] Marcus S.: Gramatici şi automate finite. Editura acadеmiеi rеpublicii popularе Rominе, 1964. | MR

[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. | MR

[11] Gruska J.: On a classification of context-free languages. Kybеrnеtika (Praguе) 3, Nr. 1 (1967), 22-29. | MR | Zbl

[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. | MR