×

On two-way sequential transductions of full semi-AFL’s. (English) Zbl 0387.68047


MSC:

68Q45 Formal languages and automata
PDF BibTeX XML Cite
Full Text: DOI

References:

[1] Ehrich, R.W.; Yau, S.S., Two-way sequential transductions and stack automata, Information and control, 18, 404-446, (1971) · Zbl 0222.94063
[2] Ginsburg, S.; Greibach, S.A., Abstract families of languages, Studies in abstract families of languages, memoirs of the American mathematical society, No. 87, 1-32, (1969)
[3] Ginsburg, S.; Greibach, S., Principal AFL, J. comput. syst. sci., 4, 308-338, (1970) · Zbl 0198.03102
[4] Ginsburg, S.; Spanier, E.H., AFL with the semilinear property, J. comput. and syst. sci., 5, 365-396, (1971) · Zbl 0235.68029
[5] Greibach, S.A., Checking automata and one-way stack languages, J. comput. syst. sci., 3, 196-217, (1969) · Zbl 0174.02702
[6] S.A. Greibach, One-way finite visit automata, Theoret. Comput. Sci.. to appear. · Zbl 0368.68059
[7] Ibarra, O.H., Simple matrix languages, Information and control, 17, 359-394, (1970) · Zbl 0221.68041
[8] Ibarra, O.H., Controlled pushdown automata, Information sciences, 6, 327-342, (1973) · Zbl 0278.68047
[9] Parikh, R.J., On context-free languages, J. ACM, 13, 570-581, (1966) · Zbl 0154.25801
[10] Rabin, M.O.; Scott, D., Finite automata and their decision problems, IBM J. res. develop., 3, 114-125, (1959) · Zbl 0158.25404
[11] Rajlich, V., Absolutely parallel grammars and two-way finite-state transducers, J. comput. and syst. sci., 6, 324-342, (1972) · Zbl 0246.68013
[12] Siromoney, R., On equal matrix languages, Information and control, 14, 135-151, (1969) · Zbl 0169.31402
[13] Siromoney, R., Finite turn checking automata, J. of comput. syst. sci., 5, 549-559, (1971) · Zbl 0231.68032
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.