On the descriptional complexity of stateless deterministic ordered restarting automata
From MaRDI portal
Recommendations
- On the descriptional complexity of deterministic ordered restarting automata
- Reversible Ordered Restarting Automata
- On some decision problems for stateless deterministic ordered restarting automata
- On the effects of nondeterminism on ordered restarting automata
- On stateless deterministic restarting automata
Cites work
- scientific article; zbMATH DE number 6016068 (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 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1747447 (Why is no real title available?)
- scientific article; zbMATH DE number 941396 (Why is no real title available?)
- scientific article; zbMATH DE number 3241282 (Why is no real title available?)
- Algebraic decision procedures for local testability
- Alternation
- Bounded-crossing transducers
- Characterizing the rational functions by restarting transducers
- Characterizing the regular languages by nonforgetting restarting automata
- Determination of finite automata accepting subregular languages
- Deterministic ordered restarting automata for picture languages
- Deterministic ordered restarting automata that compute functions
- Families of locally testable languages
- In Search of Most Complex Regular Languages
- Intersection and union of regular languages and state complexity
- Locally testable languages
- MSO definable string transductions and two-way finite-state transducers
- More concise representation of regular languages by automata and regular expressions
- On Relations Defined by Generalized Finite Automata
- On some decision problems for stateless deterministic ordered restarting automata
- On the descriptional complexity of deterministic ordered restarting automata
- On the effects of nondeterminism on ordered restarting automata
- One-tape, off-line Turing machine computations
- Ordered restarting automata for picture languages
- Properties of Finite and Pushdown Transducers
- Relationships between nondeterministic and deterministic tape complexities
- Restarting transducers, regular languages, and rational relations
- Reversible Ordered Restarting Automata
- Space-bounded reducibility among combinatorial problems
- State-complexity of finite-state devices, state compressibility and incompressibility
- Succinct description of regular languages by weak restarting automata
- The state complexities of some basic operations on regular languages
- Weight-reducing Hennie machines and their descriptional complexity
Cited in
(15)- On Stateless Deterministic Restarting Automata
- Nondeterministic ordered restarting automata
- OPTIMAL SIMULATIONS OF WEAK RESTARTING AUTOMATA
- On the expressive power of stateless ordered restart-delete automata
- Reversibility for stateless ordered RRWW-automata
- On stateless two-pushdown automata and restarting automata
- On stateless deterministic restarting automata
- A pumping lemma for ordered restarting automata
- On the descriptional complexity of deterministic ordered restarting automata
- Succinct description of regular languages by weak restarting automata
- On deterministic ordered restart-delete automata
- On the effects of nondeterminism on ordered restarting automata
- Deterministic ordered restarting automata that compute functions
- On the Descriptional Complexity of the Window Size for Deterministic Restarting Automata
- On some decision problems for stateless deterministic ordered restarting automata
This page was built for publication: On the descriptional complexity of stateless deterministic ordered restarting automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1706159)
