×

Abstract families of relations. (English) Zbl 0226.68033


MSC:

68Q45 Formal languages and automata
68Q42 Grammars and rewriting systems
03D05 Automata and formal grammars in connection with logical questions
PDF BibTeX XML Cite
Full Text: DOI

References:

[1] Aho, A.V., Nested stack automata, J. assoc. comp. Mach., 16, 383-406, (1969) · Zbl 0184.28603
[2] Aho, A.V.; Hopcroft, J.E.; Ullman, J.D., A general theory of translations, Math. systems J., 3, 193-221, (1969) · Zbl 0175.00803
[3] Aho, A.V.; Ullman, J.D., Syntax directed translations and the pushdown assembler, J. comp. system science, 3, 37-56, (1969) · Zbl 0182.02003
[4] Aho, A.V.; Ullman, J.D., Properties of syntax directed translations, J. comp. syst. sci., 3, 319-334, (1969) · Zbl 0174.02802
[5] Culik, K., Well-translatable languages and ALGOL-like languages, (), 76-85
[6] Culik, K., Relation represented by n-tape automata, Kybernetika, 3, 321-345, (1967), (in Czech)
[7] Culik, K., n-ary grammars and the description of mapping of languages, Kynerbetika, 6, 99-117, (1970) · Zbl 0194.31602
[8] {\scK. Culik II and C. J. W. Morey}, Formal Schemes for Language Translations, Intern. J. Computer Math., to appear. · Zbl 0307.68056
[9] Elgot, C.C.; Mezei, J.E., On relations defined by generalized finite automata, IBM J. res. develop., 9, 47-68, (1965) · Zbl 0135.00704
[10] Fischer, P.C.; Rosenberg, A.L., Multitape one-way nonwriting automata, J. comp. syst. sci., 2, 88-101, (1968) · Zbl 0159.01504
[11] Ginsburg, S.; Greibach, S., Abstract families of languages, (), 1-32 · Zbl 0308.68058
[12] Ginsburg, S.; Greibach, S., Principal AFL, J. comp. syst. sci., 4, 308-338, (1970) · Zbl 0198.03102
[13] Ginsburg, S.; Greibach, S.A.; Harrison, M.A., Stack automata and compiling, J. assoc. comput. Mach., 14, 172-201, (1967) · Zbl 0153.01101
[14] Ginsburg, S.; Greibach, S.; Hopcroft, J., Pre-afl, (), 41-51
[15] Ginsburg, S.; Rose, G.F., A note on preservation of languages by transducers, Information and control, 12, 549-552, (1968) · Zbl 0165.02301
[16] Greibach, S.A., An infinite hierarchy of context-free languages, J. assoc. comput. Mach., 16, 91-106, (1969) · Zbl 0182.02002
[17] {\scO. H. Ibarra}, Characterizations of transductions defined by abstract families of transducers, J. Math. Syst. Theory, to appear.
[18] Lewis, P.M.; Stearns, R.E., Syntax directed transductions, J. assoc. comput. Mach., 15, 464-488, (1968) · Zbl 0164.32102
[19] Rabin, M.O.; Scott, D., Finite automata and their decision problems, IBM J. res. develop., 3, 114-125, (1959) · Zbl 0158.25404
[20] Culik, K., Abstract families of relations, () · Zbl 0226.68033
[21] Goldstine, J., Abstract families of languages generated by bounded languages, SDC document TM-738/059/00, (1970)
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.