Iterated sequential transducers as language generating devices

Authors:
Henning Bordihn;Henning Fernau;Markus Holzer;Vincenzo Manca;Carlos Martín-Vide
Affiliations:
Institut für Informatik, Universität Potsdam, August-Bebel-Straße, Potsdam, Germany;Universität Trier, Abteilung Informatik, Trier, Germany;Institut für Informatik, Technische Universität München, Garching bei München, Germany;Università degli Studi di Pisa, Dipartimento di Informatica, Corso Italia, Pisa, Italy;Research Group on Mathematical Linguistics, Rovira i Virgili University, Pl. Imperial Tarraco, Tarragona, Spain
Venue:
Theoretical Computer Science
Year:
2006

Citing 10
Cited 0

Iterated GSMs and Co-CFL

Acta Informatica
Mathematical Theory of L Systems

Mathematical Theory of L Systems
Developmental Systems and Languages

Developmental Systems and Languages
Iterated Transductions and Efficient Learning from Positive Data: A Unifying View

ICGI '00 Proceedings of the 5th International Colloquium on Grammatical Inference: Algorithms and Applications
A Framework for Studying Grammars

Proceedings on Mathematical Foundations of Computer Science
On Restarting Automata with Rewriting

New Trends in Formal Languages - Control, Cooperation, and Combinatorics (to Jürgen Dassow on the occasion of his 50th birthday)
Iterated GSM Mappings: A Collapsing Hierarchy

Jewels are Forever, Contributions on Theoretical Computer Science in Honor of Arto Salomaa
Iterated Length-Preserving Rational Transductions

MFCS '98 Proceedings of the 23rd International Symposium on Mathematical Foundations of Computer Science
Automata Studies. (AM-34) (Annals of Mathematics Studies)

Automata Studies. (AM-34) (Annals of Mathematics Studies)
Introduction to Automata Theory, Languages, and Computation (3rd Edition)

Introduction to Automata Theory, Languages, and Computation (3rd Edition)

Quantified Score

Hi-index	5.23

Visualization

Abstract

Iterated finite state sequential transducers are considered as language generating devices. The hierarchy induced by the size of the state alphabet is proved to collapse to the fourth level. The corresponding language families are related to the families of languages generated by Lindenmayer systems and Chomsky grammars. Finally, some results on deterministic and extended iterated finite state transducers are established.