Pages that link to "Item:Q5492888"
From MaRDI portal
The following pages link to Mathematical Foundations of Computer Science 2005 (Q5492888):
Displayed 33 items.
- State complexity of operations on two-way finite automata over a unary alphabet (Q443746) (← links)
- Descriptional complexity of unambiguous input-driven pushdown automata (Q484313) (← links)
- On the state complexity of operations on two-way finite automata (Q515574) (← links)
- Two double-exponential gaps for automata with a limited pushdown (Q515677) (← links)
- Complexity of multi-head finite automata: origins and directions (Q616495) (← links)
- Concatenation operations and restricted variants of two-dimensional automata (Q831799) (← links)
- New size hierarchies for two way automata (Q1992112) (← links)
- Almost event-rate independent monitoring (Q2008287) (← links)
- Descriptional complexity of regular languages (Q2074214) (← links)
- Deterministic one-way simulation of two-way deterministic finite automata over small alphabets (Q2096581) (← links)
- Homomorphisms on graph-walking automata (Q2164747) (← links)
- On the transformation of two-way deterministic finite automata to unambiguous finite automata (Q2232267) (← links)
- Oblivious two-way finite automata: decidability and complexity (Q2252534) (← links)
- Boolean language operations on nondeterministic automata with a pushdown of constant height (Q2403237) (← links)
- Improved complement for two-way alternating automata (Q2675811) (← links)
- On the Determinization Blowup for Finite Automata Recognizing Equal-Length Languages (Q2944880) (← links)
- Complexity of Promise Problems on Classical and Quantum Automata (Q2944886) (← links)
- From Two-Way to One-Way Finite Automata—Three Regular Expression-Based Methods (Q2947420) (← links)
- Partially Ordered Two-Way Büchi Automata (Q3073637) (← links)
- Descriptional Complexity of Input-Driven Pushdown Automata (Q3166952) (← links)
- On the Size of Two-Way Reasonable Automata for the Liveness Problem (Q3451094) (← links)
- On the State Complexity of Operations on Two-Way Finite Automata (Q3533031) (← links)
- Nondeterministic Finite Automata—Recent Results on the Descriptional and Computational Complexity (Q3602795) (← links)
- On the Size of Two-Way Reasonable Automata for the Liveness Problem (Q4640037) (← links)
- On the Length of Shortest Strings Accepted by Two-way Finite Automata (Q5158651) (← links)
- Descriptional Complexity of the Forever Operator (Q5384434) (← links)
- Homomorphisms and inverse homomorphisms on graph-walking automata (Q6057839) (← links)
- On the complexity of decision problems for some classes of machines and applications (Q6077841) (← links)
- Optimal 2DFA Algorithms for One-Way Liveness on Two and Three Symbols (Q6163616) (← links)
- Space Complexity of Stack Automata Models (Q6169902) (← links)
- Shortest accepted strings for two-way finite automata: approaching the \(2^n\) lower bound (Q6175095) (← links)
- On the transformation of two-way finite automata to unambiguous finite automata (Q6186312) (← links)
- Once-Marking and Always-Marking 1-Limited Automata (Q6204137) (← links)