Semi-synchronous transductions
From MaRDI portal
Publication:1006891
DOI10.1007/S00236-008-0083-2zbMATH Open1172.68028OpenAlexW1977983343MaRDI QIDQ1006891FDOQ1006891
Authors: Vince Bárány 
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
Recommendations
Cites Work
- Title not available (Why is that?)
- Automatic Structures: Richness and Limitations
- Logic and \(p\)-recognizable sets of integers
- Title not available (Why is that?)
- On Relations Defined by Generalized Finite Automata
- Conjugacy and Equivalence of Weighted Automata and Functional Transducers
- Synchronized rational relations of finite and infinite words
- A topological approach to transductions
- An extension of the Cobham-Semënov Theorem
- An application of the matrix representation of transductions
- Thin and slender languages
- The definable criterion for definability in Presburger arithmetic and its applications.
- The Growth Ratio of Synchronous Rational Relations Is Unique
- Rational bijection of rational sets
- Expressibility in a restricted second-order arithmetic
- Invariants of Automatic Presentations and Semi-synchronous Transductions
Cited In (6)
- The Growth Ratio of Synchronous Rational Relations Is Unique
- Asynchronous sliding block maps
- Partitioning a symmetric rational relation into two asymmetric rational relations
- Left and Right Synchronous Relations
- Zero-Avoiding Transducers, Length Separable Relations, and the Rational Asymmetric Partition Problem
- Title not available (Why is that?)
This page was built for publication: Semi-synchronous transductions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1006891)
