Recommendations
Cites work
- scientific article; zbMATH DE number 3660804 (Why is no real title available?)
- scientific article; zbMATH DE number 3588051 (Why is no real title available?)
- A topological approach to transductions
- An application of the matrix representation of transductions
- An extension of the Cobham-Semënov Theorem
- Automatic Structures: Richness and Limitations
- Conjugacy and Equivalence of Weighted Automata and Functional Transducers
- Expressibility in a restricted second-order arithmetic
- Invariants of Automatic Presentations and Semi-synchronous Transductions
- Logic and p-recognizable sets of integers
- On Relations Defined by Generalized Finite Automata
- Rational bijection of rational sets
- Synchronized rational relations of finite and infinite words
- The Growth Ratio of Synchronous Rational Relations Is Unique
- The definable criterion for definability in Presburger arithmetic and its applications.
- Thin and slender languages
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
- scientific article; zbMATH DE number 5198977 (Why is no real title available?)
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)
