Semi-synchronous transductions
From MaRDI portal
Publication:1006891
DOI10.1007/s00236-008-0083-2zbMath1172.68028OpenAlexW1977983343MaRDI QIDQ1006891
Publication date: 26 March 2009
Published in: Acta Informatica (Search for Journal in Brave)
Full work available at URL: https://ora.ox.ac.uk/objects/uuid:147db9cb-3da4-4c3f-b7b3-9fdd546b94e2
Cites Work
- Unnamed Item
- Unnamed Item
- Synchronized rational relations of finite and infinite words
- An application of the matrix representation of transductions
- Rational bijection of rational sets
- Expressibility in a restricted second-order arithmetic
- Logic and \(p\)-recognizable sets of integers
- The definable criterion for definability in Presburger arithmetic and its applications.
- Thin and slender languages
- A topological approach to transductions
- Conjugacy and Equivalence of Weighted Automata and Functional Transducers
- The Growth Ratio of Synchronous Rational Relations Is Unique
- An extension of the Cobham-Semënov Theorem
- Automatic Structures: Richness and Limitations
- Invariants of Automatic Presentations and Semi-synchronous Transductions
- On Relations Defined by Generalized Finite Automata