@article{COMIM_2000_8_1_a10,
author = {Proch\'azka, Martin},
title = {On one language with connection to determinism and bounded deleting},
journal = {Communications in Mathematics},
pages = {111--121},
year = {2000},
volume = {8},
number = {1},
mrnumber = {1800227},
zbl = {1026.68082},
language = {en},
url = {http://geodesic.mathdoc.fr/item/COMIM_2000_8_1_a10/}
}
Procházka, Martin. On one language with connection to determinism and bounded deleting. Communications in Mathematics, Tome 8 (2000) no. 1, pp. 111-121. http://geodesic.mathdoc.fr/item/COMIM_2000_8_1_a10/
[1] Chomsky N.: Linguistics, Logic, Psychology, and Computers. Computer Programming and Artificial Inteligence (an intensive course for practical scientists and engineers), Summer session, University of Michigan, 1958, pp. 424-454.
[2] Chomsky N.: Formal Properties of Grammars. Handbook of Mathematical Psychology, 2, New York, Wiley, 1963, pp. 323-418. | Zbl
[3] Jančar P., Mráz F., Plátek M., Vogel J.: Restarting Automata. Proc. FCT'95, Dresden, Germany, LNCS 965, Springer 1995, pp. 283-292. | MR
[4] Jančar P., Mráz F., Plátek M., Procházka M., Vogel J.: Restarting Automata, Marcus Grammars and Context-Free Languages. in: Dassow J., Rozenberg G., Salomaa A. (eds.): Developments in Language Theory II; World Scientific Publ., 1996, pp 102-111. | MR
[5] Jančar P., Mráz F., Plátek M., Procházka M., Vogel J.: Deleting Automata with Restart Operation. Proc. of the Згd International Conference Development in Language Theory, Thessaloniki, July-26 1997, edited by Symeon Bozapalidis, Aristotle University of Thessaloniki, pp. 191-202.