This is a preview of subscription content, log in via an institution to check access.
References
P. V. Gorshkov and A. B. Stavrovskii, “Finite automata over a direct product of free semigroups and groups and languages,” Kibernetika, No. 4, 16–20 (1990).
P. V. Gorshkov and A. B. Stavrovskii, “A subclass of deterministic context-free languages with a decidable inclusion problem,” Kibernetika, No. 2, 12–17 (1990).
J. Lalleman, Semigroups and Combinatorial Applications [Russian translation], Mir, Moscow (1985).
S. Ginsburg, The Mathematical Theory of Context Free Languages McGraw-Hill, New York (1966).
A. V. Aho and J. Ullman, The Theory of Parsing, Translation, and Compiling, Vol. 1, Prentice Hall, Englewood Cliffs, NJ (1972).
J. Hopcroft and J. Ullman, Introduction to Automata Theory, Languages, and Computation, Addison-Wesley, Reading, MA (1979).
A. V. Anisimov, “Some subclasses of deterministic context-free languages,” Kibernetika, No. 4, 64–67 (1973).
P. V. Gorshkov and A. B. Stavrovskii, A Subclass of DCF-Languages with a Decidable Inclusion Problem [in Russian], Unpublished manuscript, UkrNIINTI 17.10.88, No. 2615-Uk88.
S. Greibach and E. Friedman, “Superdeterministic PDA's: a subcase with a decidable inclusion problem,” J. ACM,27, No. 4, 675–700 (1980).
Additional information
Translated from Kibernetika i Sistemnyi Analiz, No. 1, pp. 20–29, January–February, 1993.
Rights and permissions
About this article
Cite this article
Stavrovskii, A.B., Pavliv, O.Y. Dm-automata and classes of context-free languages. Cybern Syst Anal 29, 12–19 (1993). https://doi.org/10.1007/BF01130084
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01130084