On some decidable properties of finite state translations

DOI10.1007/BF00264358zbMath0489.68076OpenAlexW2086224779MaRDI QIDQ1166939

C. Keleman, Bernd Reusch, Alan Demers

Publication date: 1982

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

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

zbMATH Keywords

deterministic transducerequivalence of single-valued transducersnondeterministic finite transductionsingle-valuedness of nondeterministic finite transducers

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (1)

Equivalence of Finite-Valued Symbolic Finite Transducers

This page was built for publication: On some decidable properties of finite state translations