Substitution expressions. (English) Zbl 0229.68026


68Q45 Formal languages and automata


Full Text: DOI


[1] Arden, D.N., Delayed logic and finite state machines, (), 131-151
[2] Bar-Hillel, Y., ()
[3] Brzozowski, J.A., Regular-like expressions for some irregular languages, () · Zbl 0199.04501
[4] Eggan, L.C., Transition graphs and the star height of regular events, Michigan math. J., 10, 385-397, (1963) · Zbl 0173.01504
[5] Ginsburg, S.; Rice, H.C., Two families of languages related to ALGOL, J. assoc. comput. Mach., 9, 3, (1962) · Zbl 0161.13903
[6] Greibach, S., A new normal form theorem for context-free phase structure grammars, J. assoc. comput. Mach., 12, 42-52, (1965) · Zbl 0135.18404
[7] Greibach, S., Full AFLs and nested iterated substitution, Information and control, 16, 7-35, (1970) · Zbl 0188.03102
[8] {\scJ. Gruska}, A characterization of context-free languages, J. Comput. System Sci., to appear. · Zbl 0271.68057
[9] Hopcroft, J.E.; Ullman, J.D., ()
[10] Kral, J., A modification of a substitution theorem and some necessary and sufficient conditions for sets to be context-free, Math. systems theory, 4, 129-139, (1970) · Zbl 0199.31301
[11] McWhirter, I.P., ()
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.