Publication:3853135
From MaRDI portal
zbMath0419.68086MaRDI QIDQ3853135
Publication date: 1979
68Q70: Algebraic theory of languages and automata
20M35: Semigroups in automata theory, linguistics, etc.
Related Items
Unnamed Item, Unnamed Item, Subsequential transducers: a coalgebraic perspective, Varieties and rational functions, Counting with rational functions, A closure property of deterministic context-free languages, 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., Sequential?, Computing the prefix of an automaton, Coalgebraising Subsequential Transducers, A Circuit Complexity Approach to Transductions