×

zbMATH — the first resource for mathematics

AFL with the semilinear property. (English) Zbl 0235.68029

MSC:
68Q45 Formal languages and automata
Software:
ALGOL 60
PDF BibTeX XML Cite
Full Text: DOI
References:
[1] Chomsky, N.; Schutzenberger, M.P., The algebraic theory of context-free languages, (), 118-161 · Zbl 0148.00804
[2] Elgot, C.C., Decision problems of finite automata design and related arithmetics, Transactions of the American mathematical society, vol. 98, 21-51, (1961) · Zbl 0111.01102
[3] Fischer, P.C.; Meyer, A.R.; Rosenberg, A.L., Counter machines and counter languages, Mathematical systems theory, vol. 2, 265-283, (1968) · Zbl 0165.32002
[4] Ginsburg, S., ()
[5] {\scGinsburg, S. and S. Greibach}, “Abstract Families of Languages”, in Studies in Abstract Families of Languages, Memoirs of the American Mathematical Society, no. 87 (1969), pp. 1-32.
[6] Ginsburg, S.; Greibach, S., Principal AFL, Journal of computer and system sciences, vol. 4, 308-338, (1970) · Zbl 0198.03102
[7] Ginsburg, S.; Spanier, E.H., Bounded algol-like languages, Transactions of the American mathematical society, vol. 113, 333-368, (1966) · Zbl 0142.24803
[8] Ginsburg, S.; Spanier, E.H., Semigroups, Presburger formulas, and languages, Pacific journal of mathematics, vol. 16, 285-296, (1966) · Zbl 0143.01602
[9] Ginsburg, S.; Spanier, E.H., Bounded regular sets, (), 1043-1049 · Zbl 0147.25301
[10] Ginsburg, S.; Spanier, E.H., Control sets on grammars, Mathematical systems theory, vol. 2, 159-177, (1968) · Zbl 0157.33604
[11] Ginsburg, S.; Spanier, E.H., Substitution in families of languages, Information sciences, vol. 2, 83-110, (1960) · Zbl 0211.31401
[12] {\scGreibach, S. and J. Hopcroft}, “Independence of AFL Operation”, in Studies in Abstract Families of Languages, Memoirs of the American Mathematical Society, no. 87 (1969), pp. 32-40.
[13] Ibarra, O.H., Simple matrix languages, Information and control, vol. 17, 359-394, (1970) · Zbl 0221.68041
[14] Kasai, Takumi, An hierarchy between context-free and context-sensitive languages, Journal of computer and system sciences, vol. 4, 492-508, (1970) · Zbl 0212.02705
[15] Laing, R.; Wright, J.B., Commutative machines, ()
[16] Parikh, R.J., On contex-free languages, Journal of the association for computing machinery, vol. 13, 570-581, (1966) · Zbl 0154.25801
[17] Rabin, M.; Scott, D., Finite automata and their decision problems, IBM journal of research and development, vol. 3, 114-125, (1959) · Zbl 0158.25404
[18] Redko, V.N., On the commutative closure of events, Dopovidi akad. nauk ukrain. RSR, 1156-1159, (1963)
[19] Siromoney, R., On equal matrix languages, Information and control, vol. 14, 135-151, (1969) · Zbl 0169.31402
[20] {\scSiromoney, R.}, “k-Turn One-Way Stack Automata”, to appear in the Journal of Computer and System Sciences.
[21] {\scNash B.O.}, “Parallel Leveled Grammars”. IEEE Conference Record of 1969, Tenth Annual Symposium on Switching and Automata Theory. 263-276.
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.