Iterating Inverse Binary Transducers (original) (raw)
Related papers
Iterating Invertible Binary Transducers
Extended Abstract : Decision Problems on Iterated Length-Preserving Transducers
2011
On implementing recognizable transductions
International Journal of Computer Mathematics, 2010
On Equivalence and Uniformisation Problems for Finite Transducers
2016
On Straight Words and Minimal Permutators in Finite Transformation Semigroups
Workshop on Implementing Automata/Conference on Implementation and Application of Automata, 2010
AUTOMATICITY AND PRESENTATIONS OF SEMIGROUPS (Algebras, Languages, Algorithms and Computations)
2011
Finite semigroups, feedback, and the Letichevsky criteria on non-empty words in finite automata
Theoretical Computer Science, 2003
Acta Cybernetica, 2006
Recognizable Transductions, Saturated Transducers and Edit Languages⋆
On the decidability of the word problem for amalgamated free products of inverse semigroups
Semigroup Forum, 2007
xiii + 412 pp. Michael A. Arbib, ,Theories of Abstract Automata (1969) Prentice-Hall,Providence, RI
1971
Lexicographic Decomposition of k-Valued Transducers
Theory of Computing Systems, 2010
Transformations Induced by Transducers
Triangle, 2018
Primitive Recursive Presentations of Transducers and their Products
2015
Characterizations of rational ω-languages by means of right congruences
Theoretical Computer Science, 1995
The Journal of Symbolic Logic, 2009
On complete systems of automata
Theoretical Computer Science, 2000
A characterization of automata and a direct product decomposition
Journal of Computer and System Sciences, 1976
Conjugacy and Equivalence of Weighted Automata and Functional Transducers
Computer Science – Theory and Applications, 2006
Some operations and transductions that preserve rationality
Lecture Notes in Computer Science
Ordering sequences by permutation transducers
Indagationes Mathematicae, 2016
C C ] 4 S ep 2 01 8 Undecidable word problem in subshift automorphism groups
2018
Some undecidability results for asynchronous transducers and the Brin-Thompson group 2V2V2V
Transactions of the American Mathematical Society, 2016
An automata-theoretic approach to the word problem for ω -terms over R
Theoretical Computer Science, 2007
Journal of emerging technologies and innovative research, 2020
On the representation of finite deterministic 2-tape automata
Theoretical Computer Science, 1999
The “last” decision problem for rational trace languages
Lecture Notes in Computer Science
Serial composition of 2-way finite-state transducers and simple programs on strings
Lecture Notes in Computer Science, 1977
Decidability of finite quasivarieties generated by certain transformation semigroups
Algebra Universalis, 2001
Partial automorphism semigroups
Annals of Pure and Applied Logic, 2008
Invariants of Automatic Presentations and Semi-Synchronous Transductions with Appendix
IN STACS 2006, LNCS, 2006
Journal of Computer and System Sciences, 1977
On the Decidability of the Equivalence for k-Valued Transducers (Extended Abstract
Invariants of automatic presentations and semi-synchronous transductions
STACS 2006, 2006
COMPLEXITY OF FINITE APERIODIC SEMIGROUPS AND STAR-FREE LANGUAGES