Absolutely Parallel Grammars and Two-Way Finite State Transducers

@article{Rajlich1972AbsolutelyPG,
  title={Absolutely Parallel Grammars and Two-Way Finite State Transducers},
  author={V{\'a}clav Rajlich},
  journal={J. Comput. Syst. Sci.},
  year={1972},
  volume={6},
  pages={324-342}
}
Absolutely parallel grammars are defined, and it is shown that the family of languages generated is equal to the family of languages generated by two-way deterministic finite-state transducers (abbreviated 2ft). Furthermore it is shown that this family forms a full AFL closed under substitution. It is shown that the family of languages generated by two-way nondeterministic finite-state transducers is equal to the family of checking automata languages and that it properly contains the family of… CONTINUE READING

From This Paper

Topics from this paper.
12 Citations
13 References
Similar Papers

References

Publications referenced by this paper.
Showing 1-10 of 13 references

YAU, Two-way sequential transducers and stack automata

  • S.S.R. EHRICH
  • Inform. Control
  • 1971
Highly Influential
5 Excerpts

Absolutely parallel grammars and two-way finite-state transducers

  • V. RAJLICH
  • Ph.D. Dissertation,
  • 1971
3 Excerpts

ULLMAN, A characterization of two-way deterministic classes of languages

  • V AHOJ.D.A.
  • J. Comput. System Sci
  • 1970
3 Excerpts

GREIBACH AND J. HOPCROFT, Independence of AFL operations, Mere

  • S A.
  • Amer. Math. Soc
  • 1969
1 Excerpt

GREIBACH AND J. HOPCROFT, Scattered context grammars

  • S A.
  • J. Comput. System Sci
  • 1969

GREIBACH, Abstract families of languages, Mere

  • S.A.S. GINSBURG
  • Amer. Math. Soc
  • 1969
1 Excerpt

GREIBACH, Checking automata and one-way stack languages

  • S A.
  • J. Comput. System Sci
  • 1969
2 Excerpts

J

  • AN J. HOPCROFT
  • ULLMAN, "Formal Languages and their Relation to…
  • 1969
1 Excerpt

Similar Papers

Loading similar papers…