×
Goldstine, Jonathan

Substitution and bounded languages. (English) Zbl 0232.68030

J. Comput. Syst. Sci. 6, 9-29 (1972).
Page: −5 −4 −3 −2 −1 ±0 +1 +2 +3 +4 +5 Show Scanned Page
scan of Zbl 0232.68030

Cited in 17 Documents

MSC:

68Q45 Formal languages and automata

Software:

ALGOL 60
Cite Review PDF
Full Text: DOI

References:

[1] Ginsburg, S.; Greibach, S., Abstract families of languages, in Studies in Abstract Families of Languages, Amer. Math. Soc. Memoir, 87, 1-32 (1969) · Zbl 0194.31402
[2] Ginsburg, S.; Greibach, S., Principal AFL, J. Comput. System Sci., 4, 308-338 (1970) · Zbl 0198.03102
[3] Ginsburg, S.; Spanier, E. H., Finite-turn pushdown automata, SIAM J. Control, 4, 429-453 (1966) · Zbl 0147.25302
[4] Ginsburg, S.; Spanier, E. H., Bounded ALGOL-like languages, Trans. Amer. Math. Soc., 113, 333-368 (1964) · Zbl 0142.24803
[5] Ginsburg, S.; Spanier, E. H., Bounded regular sets, Proc. Amer. Math. Soc., 17, 1043-1049 (1966) · Zbl 0147.25301
[6] J. Goldstine; J. Goldstine · Zbl 0331.68043
[7] Greibach, S., An infinite hierarchy of context-free languages, J. Assoc. Comput. Mach., 16, 91-106 (1969) · Zbl 0182.02002
[8] Greibach, S., Checking automata and one-way stack languages, J. Comput. System Sci., 3, 196-217 (1969) · Zbl 0174.02702
[9] Greibach, S., Chains of full AFLs, Math. Systems Theory, 4, 231-242 (1970) · Zbl 0203.30102
[10] S. GreibachJ. Comput. System Sci.; S. GreibachJ. Comput. System Sci. · Zbl 0269.68046
[11] Hartmanis, J.; Hopcroft, J., What makes some language theory problems undecidable, J. Comput. System Sci., 4, 368-376 (1970) · Zbl 0198.03001
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.