Mathematical Foundations of Computer Science 2005
From MaRDI portal
Publication:5492888
DOI10.1007/11549345zbMath1156.68456OpenAlexW2494705596MaRDI QIDQ5492888
Publication date: 20 October 2006
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11549345
Related Items (33)
Concatenation operations and restricted variants of two-dimensional automata ⋮ Descriptional Complexity of Input-Driven Pushdown Automata ⋮ On the Size of Two-Way Reasonable Automata for the Liveness Problem ⋮ Homomorphisms on graph-walking automata ⋮ Boolean language operations on nondeterministic automata with a pushdown of constant height ⋮ On the Determinization Blowup for Finite Automata Recognizing Equal-Length Languages ⋮ Complexity of Promise Problems on Classical and Quantum Automata ⋮ From Two-Way to One-Way Finite Automata—Three Regular Expression-Based Methods ⋮ Complexity of multi-head finite automata: origins and directions ⋮ Improved complement for two-way alternating automata ⋮ Homomorphisms and inverse homomorphisms on graph-walking automata ⋮ On the complexity of decision problems for some classes of machines and applications ⋮ Optimal 2DFA Algorithms for One-Way Liveness on Two and Three Symbols ⋮ Shortest accepted strings for two-way finite automata: approaching the \(2^n\) lower bound ⋮ On the transformation of two-way finite automata to unambiguous finite automata ⋮ Once-Marking and Always-Marking 1-Limited Automata ⋮ On the Size of Two-Way Reasonable Automata for the Liveness Problem ⋮ State complexity of operations on two-way finite automata over a unary alphabet ⋮ On the State Complexity of Operations on Two-Way Finite Automata ⋮ Descriptional Complexity of the Forever Operator ⋮ Descriptional complexity of unambiguous input-driven pushdown automata ⋮ On the transformation of two-way deterministic finite automata to unambiguous finite automata ⋮ On the Length of Shortest Strings Accepted by Two-way Finite Automata ⋮ On the state complexity of operations on two-way finite automata ⋮ Two double-exponential gaps for automata with a limited pushdown ⋮ New size hierarchies for two way automata ⋮ Oblivious two-way finite automata: decidability and complexity ⋮ Almost event-rate independent monitoring ⋮ Nondeterministic Finite Automata—Recent Results on the Descriptional and Computational Complexity ⋮ Partially Ordered Two-Way Büchi Automata ⋮ Descriptional complexity of regular languages ⋮ Deterministic one-way simulation of two-way deterministic finite automata over small alphabets ⋮ Space Complexity of Stack Automata Models
This page was built for publication: Mathematical Foundations of Computer Science 2005
