@article{107137, author = {Jan Ostravsk\'y}, title = {Acceptors and generalized $lc$-grammars}, journal = {Archivum Mathematicum}, volume = {018}, year = {1982}, pages = {151-162}, zbl = {0518.68044}, mrnumber = {682103}, language = {en}, url = {http://dml.mathdoc.fr/item/107137} }
Ostravský, Jan. Acceptors and generalized $lc$-grammars. Archivum Mathematicum, Tome 018 (1982) pp. 151-162. http://gdmltest.u-ga.fr/item/107137/
Contextual grammars, Rev. Roum. Math. Puгes et Appl. 14 (1969), 1525-1934. (1969) | MR 0262026 | Zbl 0193.32401
On a class of contextual grammars, Cahieгs de linguistique théorique et appliquée 11 (1974), Fasc. 2, 313-314. (1974)
On muiticontextual grammars, (manuscгipt).
On some variants of contextual languages, Rеv. Roum. Math. Purеs еt Appl. 21 (1976), 1053-1062. (1976) | MR 0428829
Each generalized contextual language is context sensitive, Rеv. Roum. Math. Purеs еt Appl. 21 (1976), 353-362. (1976) | MR 0405943 | Zbl 0333.68048
The mathematical theory of context-free languages, Mc Graw Hill Book Company Nеw York, 1966. (1966) | MR 0211815 | Zbl 0184.28401
Maszyny programowane, Algorytmy 10, volumе 5, 1969, 5-19. (1969) | MR 0255104
Some notes on finite state languages and events represented by finite automata using labelled graphs, Čas. pěst. mat, 86, 43-55 (1961). (1961) | MR 0130062
Gramatici şi automate finite, Editura acadеmiеi rеpublicii popularе Rominе, 1964. (1964) | MR 0174411
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) | MR 0489052
On a classification of context-free languages, Kybеrnеtika (Praguе) 3, Nr. 1 (1967), 22-29. (1967) | MR 0209092 | Zbl 0158.25401
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) | MR 0405938