Highly Influenced

# 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} }

- Published 1972 in J. Comput. Syst. Sci.
DOI:10.1016/S0022-0000(72)80025-4

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