On Two-Way Sequential Transductions of Full Semi-AFL's

Abstract Algebraic and grammatical characterizations of several classes of two-way sequential transductions of languages in a full semiAFL are presented. The algebraic characterizations are in terms of “generalized” replications involving homomorphisms and finite substitutions. The grammars are simple and are of the form found in parallel rewriting systems.

[1]  Sheila A. Greibach,et al.  One Way Finite Visit Automata , 1978, Theor. Comput. Sci..

[2]  Václav Rajlich.  Absolutely Parallel Grammars and Two-Way Finite State Transducers , 1972, J. Comput. Syst. Sci..

[3]  Seymour Ginsburg,et al.  Principal AFL , 1970, J. Comput. Syst. Sci..

[4]  Rani Siromoney,et al.  On Equal Matrix Languages , 1969, Inf. Control..

[5]  Seymour Ginsburg,et al.  AFL with the Semilinear Property , 1971, J. Comput. Syst. Sci..

[6]  Rohit Parikh,et al.  On Context-Free Languages , 1966, JACM.

[7]  Seymour Ginsburg,et al.  Abstract Families of Languages , 1967, SWAT.

[8]  Dana S. Scott,et al.  Finite Automata and Their Decision Problems , 1959, IBM J. Res. Dev..

[9]  Rani Siromoney.  Finite-Turn Checking Automata , 1971, J. Comput. Syst. Sci..

[10]  Oscar H. Ibarra.  Controlled pushdown automata , 1973, Inf. Sci..

[11]  Sheila A. Greibach,et al.  Checking Automata and One-Way Stack Languages , 1969, J. Comput. Syst. Sci..

[12]  Stephen S. Yau,et al.  Two-Way Sequential Transductions and Stack Automata , 1971, Inf. Control..

[13]  Oscar H. Ibarra,et al.  Simple Matrix Languages , 1970, Inf. Control..