Concatenation of inputs in a two-way automaton
From MaRDI portal
Publication:1115636
DOI10.1016/0304-3975(89)90075-3zbMath0664.68081MaRDI QIDQ1115636
Publication date: 1989
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(89)90075-3
subset construction; crossing sequence; Birget semigroup; concatenation of inputs; global transition maps; two-way automaton; two-way transformation semigroups
68Q45: Formal languages and automata
68Q70: Algebraic theory of languages and automata
20M35: Semigroups in automata theory, linguistics, etc.
Related Items
Two-way automata and length-preserving homomorphisms, State-complexity of finite-state devices, state compressibility and incompressibility, The zig-zag power series: A two-way version of the \({}^*\) operator., Sur les codes zigzag et leur décidabilité. (Zigzag codes and their decidability), Positional simulation of two-way automata: Proof of a conjecture of R. Kannan and generalizations, Two-way automaton computations
Cites Work