×

A hierarchy of deterministic languages. (English) Zbl 0426.68067


MSC:

68Q45 Formal languages and automata
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] Courcelle, B., A representation of trees by languages, I, Theor. Comput. Sci., 6, 255-279 (1978) · Zbl 0377.68040
[2] Geller, M. M.; Harrison, M. A., On LR \((k)\) grammars and languages, Theor. Comput. Sci., 4, 245-276 (1977) · Zbl 0357.68083
[3] Harrison, M. A., Introduction to Formal Language Theory (1978), Addison-Wesley: Addison-Wesley Reading, Mass · Zbl 0411.68058
[4] Harrison, M. A.; Havel, I. M., Strict deterministic grammars, J. Comput. System Sci., 7, 237-277 (1975) · Zbl 0261.68036
[5] Knuth, D. E., On the translation of languages from left to right, Inform. Contr., 8, 607-639 (1965) · Zbl 0231.68027
[6] Nerode, A., Linear automaton transformations, (Proc. Amer. Math. Soc., 9 (1958)), 541-548 · Zbl 0089.33403
[7] Rabin, M. O.; Scott, D., Finite automata and their decision problems, IBM J. Res. Develop., 3, 114-175 (1959) · Zbl 0158.25404
[8] Salomaa, A., On the reducibility of events represented in automata, Ann. Acad. Sci. Fenn. Ser. AI, 353 (1964) · Zbl 0168.26003
[9] Stearns, R. E., A regularity test for pushdown machines, Inform. Contr., 11, 323-340 (1967) · Zbl 0155.01901
[10] Valiant, L. G., Regularity and related problems for deterministic pushdown automata, J. Assoc. Comput. Mach., 22, 1-10 (1975) · Zbl 0293.68046
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.