Equivalence problems for transducers with a bounded number of states

DOI10.1007/BF02733223zbMath0919.68079OpenAlexW2093874952MaRDI QIDQ1280978

L. P. Lisovik

Publication date: 15 March 1999

Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)

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

zbMATH Keywords

sequential transducers

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (2)

A simple undecidable problem: the inclusion problem for finite substitutions on \(ab^* c\) ⋮ Finite transducers and rational transductions

Cites Work

• Unnamed Item
• Unnamed Item
• The equivalence problem for deterministic two-tape automata
• Equivalence of transducers relative to regular languages
• An undecidable problem for countable markov chains

This page was built for publication: Equivalence problems for transducers with a bounded number of states