×
Thatcher, J. W.

Generalized sequential machine maps. (English) Zbl 0198.03303

J. Comput. Syst. Sci. 4, 339-367 (1970).
Page: −5 −4 −3 −2 −1 ±0 +1 +2 +3 +4 +5 Show Scanned Page
scan of Zbl 0198.03303

Cited in 91 Documents

Keywords:

languages, automata, networks

Software:

ALGOL 60
PDF BibTeX XML Cite
\textit{J. W. Thatcher}, J. Comput. Syst. Sci. 4, 339--367 (1970; Zbl 0198.03303)
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, (Proc. 9th Ann. Symp. on Switching and Automata Theory (October 1968)) · Zbl 0174.02802
[3] Aho, A. V.; Ullman, J. D., Translating on a context-free grammar, (Proc. ACM Symp. Theory of Computing (1968)), 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, (Ph.D. dissertation (June 1967), Purdue University) · Zbl 0169.31601
[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, (Recursive Function Theory. Recursive Function Theory, Proc. Symposia Pure Math., Vol. V (1962), Amer. Math. Soc.: Amer. Math. Soc. Providence, R. I.), 139-199 · Zbl 0145.24303
[10] Chomsky, N., On the notion of ‘rule of grammar’, (Structure of Language and Its Mathematical Aspects. Structure of Language and Its Mathematical Aspects, Proc. Symposia Appl. Math., Vol. XII (1961), Amer. Math. Soc.: Amer. Math. Soc. Providence, R. I.), 6-24
[11] Chomsky, N., (Aspects of the Theory of Syntax (1965), The M.I.T. Press: The M.I.T. Press Cambridge, Massachusetts)
[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, (Proc. 9th Ann. Symp. on Switching and Automata Theory (October 1968))
[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., (The Mathematical Theory of Context-Free Languages (1966), McGraw-Hill Book Co.: McGraw-Hill Book Co. New York) · Zbl 0184.28401
[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, (Proc. 9th Ann. Symp. on Switching and Automata Theory (October 1968)) · Zbl 0171.38107
[24] Rabin, M. O., Mathematical theory of automata, (Mathematical Aspects of Computer Science. Mathematical Aspects of Computer Science, Proc. Symp. Appl. Math., Vol. XIX (1967), Am. Math. Soc.: Am. Math. Soc. Providence, R. I.), 153-175 · Zbl 0189.01304
[25] Rose, G. F., An extension of ALGOL-like languages, SDC TM-738/003/00 (May, 1963)
[26] Rounds, W. C., Trees, Transducers, and Transformations, (Ph.D. dissertation (August 1968), Stanford University) · 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, (Proc. ACM Symp. Theory of Computing (1969)), 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 \(n^3\), 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.