×

zbMATH — the first resource for mathematics

Generalized sequential machine maps. (English) Zbl 0198.03303

Software:
ALGOL 60
PDF BibTeX XML Cite
Full Text: DOI
References:
[1] Aho, A.V., Indexed grammars—an extension of the context-free grammars, J. ACM, 15, 647-671, (1968) · Zbl 0175.27801
[2] Aho, A.V.; Ullman, J.D., Automaton analogs of syntax directed translation schemata, () · Zbl 0174.02802
[3] Aho, A.V.; Ullman, J.D., Translating on a context-free grammar, (), 93-112 · Zbl 1282.68147
[4] Arbib, M.A.; Give’on, Y., Algebra automata I: parallel programming as a prolegomena to the categorical approach, Information and control, 12, 331-345, (1968) · Zbl 0164.32201
[5] Bar-Hillel, Y.; Perles, M.; Shamir, E., On formal properties of phrase structure grammars, Z. phonetik, sprach. kummunikationsforsch., 14, 143-172, (1961) · Zbl 0106.34501
[6] Brainerd, W.S., Tree generating systems and tree automata, () · Zbl 0169.31601
[7] \scW. S. Brainerd, Minimalization of tree automata, snbmittud for publication. · Zbl 0181.01602
[8] Büchi, J.R., Regular canonical systems, Arch. math. logik grundlagenforschung, 6, 91-111, (1964) · Zbl 0129.26102
[9] Burks, A.W.; Wright, J.B., Sequence generators and digital computers, (), 139-199 · Zbl 0145.24303
[10] Chomsky, N., On the notion of ‘rule of grammar’, (), 6-24
[11] Chomsky, N., ()
[12] Culik, K., On some transformations in context-free grammars and languages, Czechoslovak math. J., 17, 278-311, (1967) · Zbl 0204.02103
[13] Doner, J., Tree acceptors and some of their applications, (1965), submitted for publication · Zbl 0212.02901
[14] Eilenberg, S.; Wright, J.B., Automata in general algebras, Information and control, 11, 452-470, (1967) · Zbl 0175.27902
[15] Elgot, C.C., Decision problems of finite automaton design and related arithmetics, Trans. amer. math. soc., 98, 21-51, (1961) · Zbl 0111.01102
[16] Michael J., Fischer, Grammars with macro-like productions, ()
[17] Ginsburg, S.; Rice, H.G., Two families of languages related to ALGOL, J. ACM, 9, 350-371, (1962) · Zbl 0196.01803
[18] Ginsburg, S., ()
[19] Irons, E.T., A syntax directed compiler for ALGOL 60, C. ACM, 4, 51-55, (1961) · Zbl 0103.34904
[20] Lewis, P.M.; Stearns, R.E., Syntax directed transduction, J. ACM, 15, 465-488, (1968) · Zbl 0164.32102
[21] Mezei, J.; Wright, J.B., Algebraic automata and context-free sets, Information and control, 11, 3-29, (1967) · Zbl 0155.34301
[22] Peters, S.; Ritchie, R.W., On the generative power of transformational grammars, (1967), unpublished manuscript · Zbl 0251.68045
[23] Petrone, L., Syntax directed mapping of context-free languages, () · Zbl 0171.38107
[24] Rabin, M.O., Mathematical theory of automata, (), 153-175 · Zbl 0189.01304
[25] Rose, G.F.; Rose, G.F., An extension of ALGOL-like languages, C. ACM, Sdc tm-738/003/00, 7, 52-61, (May, 1963), Also
[26] Rounds, W.C., Trees, transducers, and transformations, () · Zbl 0203.30103
[27] Thatcher, J.W., Characterizing derivation trees of context-free grammars through a generalization of finite automata theory, J. comp. system sci., 1, 317-322, (1967) · Zbl 0155.01802
[28] Thatcher, J.W.; Wright, J.B., Generalized finite automata theory with an application to a decision problem of second-order logic, Math. systems theory, 2, 57-81, (1968) · Zbl 0157.02201
[29] Thatcher, J.W., Transformations and translations from the point of view of generalized finite automata theory, (), 129-142 · Zbl 1282.68172
[30] Thatcher, J.W., Two approaches to generalized nondeterministic finite-state transformations, (1970), forthcoming · Zbl 0198.03303
[31] Younger, D.H., Recognition and parsing of context-free languages in time n3, Information and control, 10, 189-208, (1967) · Zbl 0149.24803
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.