Equivalence checking of prefix-free transducers and deterministic two-tape automata

DOI10.1007/978-3-030-13435-8_11zbMath1425.68239OpenAlexW2913293222MaRDI QIDQ2278270

Vladimir A. Zakharov

Publication date: 4 December 2019

Full work available at URL: https://doi.org/10.1007/978-3-030-13435-8_11

zbMATH Keywords

equivalence checkingdecision proceduretransducerlanguage equationprefix-free languagetwo-tape automaton

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

This page was built for publication: Equivalence checking of prefix-free transducers and deterministic two-tape automata