Iterated sequential transducers as language generating devices

DOI10.1016/J.TCS.2006.07.059MaRDI QIDQ861252zbMATH OpenOpenAlexFDO

Authors Henning Bordihn, Henning Fernau, Markus Holzer, Carlos Martín-Vide, Vincenzo Manca

Publication date 9 January 2007

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.tcs.2006.07.059

zbMATH Keywords

Lindenmayer systemsstate complexityfinite state sequential transducers

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Grammars and rewriting systems (68Q42)

Recommendations

• ON THE GENERATIVE POWER OF ITERATED TRANSDUCTION
• scientific article; zbMATH DE number 2050927
• Publication:4941159
• Iterative devices generating infinite words
• Iterated uniform finite-state transducers on unary languages

Cites work

• scientific article; zbMATH DE number 1670720 (Why is no real title available?)
• scientific article; zbMATH DE number 3677227 (Why is no real title available?)
• scientific article; zbMATH DE number 3684912 (Why is no real title available?)
• scientific article; zbMATH DE number 3772981 (Why is no real title available?)
• scientific article; zbMATH DE number 3597901 (Why is no real title available?)
• scientific article; zbMATH DE number 3628396 (Why is no real title available?)
• scientific article; zbMATH DE number 2050927 (Why is no real title available?)
• scientific article; zbMATH DE number 3802813 (Why is no real title available?)
• scientific article; zbMATH DE number 1408344 (Why is no real title available?)
• scientific article; zbMATH DE number 3311755 (Why is no real title available?)
• A note on some systems of lindenmayer
• Automata Studies. (AM-34)
• Closure under union and composition of iterated rational transductions
• Description of developmental languages using recurrence systems
• Information transmission in il systems^∗
• Iterated GSMs and CO-CFL
• Iterated a-NGSM maps and Γ systems
• Normal forms for phrase-structure grammars
• ON THE GENERATIVE POWER OF ITERATED TRANSDUCTION
• Programmed OL-systems
• The degree of parallelism
• The maximum invariant set of an automaton system

Cited in

(14)

• Computational and Descriptional Power of Nondeterministic Iterated Uniform Finite-State Transducers*
• Iterated uniform finite-state transducers on unary languages
• Descriptional complexity of iterated uniform finite-state transducers
• scientific article; zbMATH DE number 2050927 (Why is no real title available?)
• scientific article; zbMATH DE number 1408344 (Why is no real title available?)
• Descriptional complexity of iterated uniform finite-state transducers
• Iterative devices generating infinite words
• Deterministic and nondeterministic iterated uniform finite-state transducers: computational and descriptional power
• scientific article; zbMATH DE number 7770052 (Why is no real title available?)
• scientific article; zbMATH DE number 7438568 (Why is no real title available?)
• Iterated uniform finite-state transducers on unary languages
• A computation model with automatic functions and relations as primitive operations
• Alternating automatic register machines
• ON THE GENERATIVE POWER OF ITERATED TRANSDUCTION

This page was built for publication: Iterated sequential transducers as language generating devices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q861252)