Two-way automaton computations
From MaRDI portal
Recommendations
Cites work
- Arbitrary vs. regular semigroups
- Concatenation of inputs in a two-way automaton
- scientific article; zbMATH DE number 3976380 (Why is no real title available?)
- scientific article; zbMATH DE number 3660804 (Why is no real title available?)
- scientific article; zbMATH DE number 3664335 (Why is no real title available?)
- scientific article; zbMATH DE number 3782404 (Why is no real title available?)
- scientific article; zbMATH DE number 3497806 (Why is no real title available?)
- scientific article; zbMATH DE number 3254906 (Why is no real title available?)
- scientific article; zbMATH DE number 3311755 (Why is no real title available?)
Cited in
(22)- Concatenation of inputs in a two-way automaton
- Stability for the zigzag submonoids
- Converting two-way nondeterministic unary automata into simpler automata.
- Two-way automata versus logarithmic space
- Normality and two-way automata
- Two-way two-tape automata
- Improved complement for two-way alternating automata
- Two-Way Automata in Coq
- Two-Way Automata versus Logarithmic Space
- Tropical Two-Way Automata
- On $z$-submonoids and $z$-codes
- On coding morphisms for zigzag codes
- scientific article; zbMATH DE number 1502111 (Why is no real title available?)
- scientific article; zbMATH DE number 7003194 (Why is no real title available?)
- Developments in Language Theory
- Complement for two-way alternating automata
- Complement for two-way alternating automata
- A solution of the word problem for free \(^*\)-regular semigroups
- Two-Way Non-Uniform Finite Automata
- Decomposing finite-valued two-way finite transducers
- The zig-zag power series: A two-way version of the \({}^*\) operator.
- Two-way non-uniform finite automata
This page was built for publication: Two-way automaton computations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3479524)
