×

Absolutely parallel grammars and two-way finite-state transducers. (English) Zbl 0246.68013


MSC:

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

References:

[1] Aho, A.V.; Ullman, J.D., A characterization of two-way deterministic classes of languages, J. comput. system sci., 4, 523-538, (1970) · Zbl 0222.68034
[2] Ehrich, R.; Yau, S.S., Two-way sequential transducers and stack automata, Inform. control, 18, 404-446, (1971) · Zbl 0222.94063
[3] Ginsburg, S., ()
[4] Ginsburg, S.; Greibach, S.A., Abstract families of languages, Mem. amer. math. soc., 87, 1-32, (1969)
[5] Ginsburg, S.; Greibach, S.A.; Harrison, M.A., One-way stack automata, J. assoc. comput. Mach., 14, 389-418, (1967) · Zbl 0171.14803
[6] Ginsburg, S.; Rose, G.F., Preservation of languages by transducers, Inform. control, 9, 153-176, (1966) · Zbl 0186.01301
[7] Ginsburg, S.; Spanier, E.H., Derivation-bounded languages, (), 306-314
[8] Greibach, S.A., Checking automata and one-way stack languages, J. comput. system sci., 3, 196-217, (1969) · Zbl 0174.02702
[9] Greibach, S.A.; Hopcroft, J., Independence of AFL operations, Mem. amer. math. soc., 87, 33-40, (1969)
[10] Greibach, S.A.; Hopcroft, J., Scattered context grammars, J. comput. system sci., 3, 233-247, (1969) · Zbl 0174.02801
[11] Hartmanis, J.; Shank, H., On the recognition of primes by automata, J. assoc. comput. Mach., 15, 382-389, (1968) · Zbl 0164.05201
[12] Hopcroft, J.; Ullman, J., ()
[13] Nash, B.O.; Cohen, R.S., Parallel leveled grammars, (), 263-276
[14] Rajlich, V., Absolutely parallel grammars and two-way finite-state transducers, () · Zbl 0246.68013
[15] {\scG. F. Rose}, Personal communication.
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.