scientific article; zbMATH DE number 3523154
From MaRDI portal
Publication:4101446
zbMath0334.68045MaRDI QIDQ4101446
Publication date: 1975
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (16)
The equivalence of finite valued transducers (on HDT0L languages) is decidable ⋮ Multi-sequential Word Relations ⋮ Efficient Equivalence Checking Technique for Some Classes of Finite-State Machines ⋮ A unified framework for disambiguating finite transductions ⋮ Tinput-Driven Pushdown Automata ⋮ Equivalence Checking Problem for Finite State Transducers over Semigroups ⋮ New techniques for proving the decidability of equivalence problem ⋮ On the representation of finite deterministic 2-tape automata ⋮ On the Decidability of the Equivalence for k-Valued Transducers ⋮ Multi-Sequential Word Relations ⋮ Extended symbolic finite automata and transducers ⋮ Finite transducers and rational transductions ⋮ Unambiguity in Automata Theory ⋮ Determinization of transducers over finite and infinite words. ⋮ Squaring transducers: An efficient procedure for deciding functionality and sequentiality. ⋮ Toeplitz corona and the Douglas property for free functions
This page was built for publication:
