scientific article
From MaRDI portal
Publication:3853135
zbMath0419.68086MaRDI QIDQ3853135
Publication date: 1979
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Algebraic theory of languages and automata (68Q70) Semigroups in automata theory, linguistics, etc. (20M35)
Related Items (16)
Counting with rational functions ⋮ A Circuit Complexity Approach to Transductions ⋮ Subsequential transducers: a coalgebraic perspective ⋮ A closure property of deterministic context-free languages ⋮ Computing the prefix of an automaton ⋮ Varieties and rational functions ⋮ Sequential? ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ A proof of Choffrut's theorem on subsequential functions ⋮ Minimization algorithms for sequential transducers ⋮ \(L(A)=L(B)\)? decidability results from complete formal systems ⋮ Determinization of transducers over finite and infinite words. ⋮ Squaring transducers: An efficient procedure for deciding functionality and sequentiality. ⋮ Coalgebraising Subsequential Transducers
This page was built for publication: