×

zbMATH — the first resource for mathematics

Equivalence problems for deterministic context-free languages and monadic recursion schemes. (English) Zbl 0358.68109

MSC:
68Q45 Formal languages and automata
PDF BibTeX XML Cite
Full Text: DOI
References:
[1] Ashcroft, E.; Manna, A.; Pnueli, A., Decidable properties of monadic functional schemes, J. assoc. comput. Mach., 20, 489-499, (1973) · Zbl 0289.68036
[2] Chomsky, N.; Schutzenberger, M., The algebraic theory of context-free languages, () · Zbl 0148.00804
[3] Garland, S.J.; Luckham, D.C., Program schemes, recursion, schemes, and formal languages, J. comput. system sci., 7, 119-160, (1973) · Zbl 0369.68014
[4] Ginsburg, S.; Greibach, S., Deterministic context-free languages, Inform. contr., 9, 620-648, (1966) · Zbl 0145.00802
[5] Greibach, S.A., Jump Pda’s and hierarchies of deterministic context-free languages, SIAM J. comput., 3, 11-127, (1974) · Zbl 0288.68031
[6] Harrison, M.A.; Havel, I.M., Strict deterministic context-free languages, J. comput. system sci., 7, 237-277, (1973) · Zbl 0261.68036
[7] Korenjak, A.J.; Hopcroft, J.E., Simple deterministic languages, (), 36-46 · Zbl 0313.68061
[8] Rosenberg, A.L., Real-time definable languages, J. assoc. comput. Mach., 14, 645-662, (1967) · Zbl 0153.00902
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. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.