On the lengths of values in a finite transducer

DOI10.1007/BF01185566zbMath0790.68038OpenAlexW2006777369MaRDI QIDQ1323379

V. Pereyra

Publication date: 4 July 1994

Published in: Acta Informatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01185566

zbMATH Keywords

nondeterministic generalized sequential machinenormalized finite transducer

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items

Efficient Equivalence Checking Technique for Some Classes of Finite-State Machines ⋮ Equivalence of finite-valued tree transducers is decidable ⋮ On the decidability of the valuedness problem for two-way finite transducers ⋮ Using acceptors as transducers ⋮ Reasoning about strings in databases ⋮ On the Decidability of the Equivalence for a Certain Class of Transducers ⋮ Decomposing a $k$-valued transducer into $k$ unambiguous ones

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• New techniques for proving the decidability of equivalence problem
• The equivalence of finite valued transducers (on HDT0L languages) is decidable
• On the valuedness of finite transducers
• Sur les rélations rationnelles entre monoides libres
• Single-valued a-transducers
• Equivalence problem of non-deterministic finite automata
• Minimal undecidable identity problem for finite-automaton mappings
• A note on finite-valued and finitely ambiguous transducers
• The Unsolvability of the Equivalence Problem for $\varepsilon $-Free NGSM’s with Unary Input (Output) Alphabet and Applications
• The unsolvability of the Equivalence Problem for Λ-Free nondeterministic generalized machines