Characterizations of transductions defined by abstract families of transducers
From MaRDI portal
Publication:5626546
DOI10.1007/BF01694183zbMath0221.94077MaRDI QIDQ5626546
Publication date: 1971
Published in: Mathematical Systems Theory (Search for Journal in Brave)
Formal languages and automata (68Q45) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Related Items (max. 100)
Cites Work
- Unnamed Item
- A characterization of two-way deterministic classes of languages
- Abstract families of deterministic languages
- On Relations Defined by Generalized Finite Automata
- An Approach to a Unified Theory of Automata
- Two-way pushdown automata
- One-way stack automata
- Multi-tape and multi-head pushdown automata
- A general theory of translation
- An Infinite Hierarchy of Context-Free Languages
- Preservation of languages by transducers
- Operations Which Preserve Definability in Languages
This page was built for publication: Characterizations of transductions defined by abstract families of transducers