Finite transducers and rational transductions
From MaRDI portal
Publication:2074205
DOI10.4171/Automata-1/3OpenAlexW4206020540MaRDI QIDQ2074205
Tero J.Harju, Juhani Karhumäki
Publication date: 4 February 2022
Full work available at URL: https://doi.org/10.4171/automata-1/3
Related Items (1)
Cites Work
- Efficient constructions of test sets for regular and context-free languages
- Sequences of words defined by two-way transducers
- Systems of equations over a free monoid and Ehrenfeucht's conjecture
- The equivalence problem of multitape finite automata
- An application of the matrix representation of transductions
- A proof of Ehrenfeucht's conjecture
- The equivalence of finite valued transducers (on HDT0L languages) is decidable
- A representation of recursively enumerable languages by two homomorphisms and a quotient
- On the valuedness of finite transducers
- An aperiodic set of 13 Wang tiles
- A small aperiodic set of Wang tiles
- Adherences of languages
- A note on morphic characterization of languages
- Decidability problems for unary output sequential transducers
- Transductions des langages de Chomsky
- Single-valued a-transducers
- Remarks on blind and partially blind one-way multicounter machines
- On the decidability of homomorphism equivalence for languages
- Hierarchy theorems for two-way finite state transducers
- The undecidability of some equivalence problems concerning ngsm's and finite substitutions
- Equivalence problems for transducers with a bounded number of states
- Deterministic sequential functions
- A note on decidability questions on presentations of word semigroups
- How to decide continuity of rational functions on infinite words
- Equivalence of transducers relative to regular languages
- A homomorphic characterization of principal semi AFLs without using intersection with regular sets
- The equivalence problem for finite substitutions in a regular language
- Determinization of transducers over finite and infinite words.
- A topological approach to transductions
- Multitape one-way nonwriting automata
- Degrees of Infinite Words, Polynomials and Atoms
- On Synchronizing Automata and Uniform Distribution
- Decomposing a $k$-valued transducer into $k$ unambiguous ones
- Minimal undecidable identity problem for finite-automaton mappings
- Degrees of Transducibility
- The Degree of Squares is an Atom
- A new normal form for the compositions of morphisms and inverse morphisms
- Fixed Point Languages, Equality Languages, and Representation of Recursively Enumerable Languages
- A note on finite-valued and finitely ambiguous transducers
- Minimization of Rational Word Functions
- Compositional representation of rational functions
- The Unsolvability of the Equivalence Problem for $\varepsilon $-Free NGSM’s with Unary Input (Output) Alphabet and Applications
- A Purely Homomorphic Characterization of Recursively Enumerable Sets
- Undecidability of the equivalence of finite substitutions on regular language
- The Hardest Context-Free Language
- MSO definable string transductions and two-way finite-state transducers
- Uniformisation of Two-Way Transducers
- Partial-Observation Stochastic Games
- STACS 2004
- Number representation and finite automata
- The Simplest Language Where Equivalence of Finite Substitutions Is Undecidable
- The equivalence problem for languages defined by transductions on D0L languages
- On Relations Defined by Generalized Finite Automata
- The unsolvability of the Equivalence Problem for Λ-Free nondeterministic generalized machines
- The undecidability of the domino problem
- The Equivalence Problem of Finite Substitutions on ab*c, with Applications
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Finite transducers and rational transductions
