Pages that link to "Item:Q5289271"

The following pages link to State-complexity of finite-state devices, state compressibility and incompressibility (Q5289271):

Displaying 34 items.

• State succinctness of two-way finite automata with quantum and classical states (Q391188) (← links)
• On the state complexity of operations on two-way finite automata (Q515574) (← links)
• Two-way unary automata versus logarithmic space (Q549665) (← links)
• Complexity of multi-head finite automata: origins and directions (Q616495) (← links)
• Partial orders on words, minimal elements of regular languages, and state complexity (Q688156) (← links)
• Succinct description of regular languages by weak restarting automata (Q948085) (← links)
• A note on the space complexity of some decision problems for finite automata (Q1183428) (← links)
• Complexity results for two-way and multi-pebble automata and their logics (Q1349896) (← links)
• From bidirectionality to alternation. (Q1401248) (← links)
• On the descriptional complexity of stateless deterministic ordered restarting automata (Q1706159) (← links)
• On the descriptional power of heads, counters, and pebbles (Q1763719) (← links)
• Alternation in two-way finite automata (Q2029487) (← links)
• Descriptional complexity of regular languages (Q2074214) (← links)
• On the transformation of two-way deterministic finite automata to unambiguous finite automata (Q2232267) (← links)
• Evaluating Datalog via tree automata and cycluits (Q2322722) (← links)
• Deciding unifiability and computing local unifiers in the description logic \(\mathcal{EL}\) without top constructor (Q2374390) (← links)
• Adding pebbles to weighted automata: easy specification \& efficient evaluation (Q2447753) (← links)
• From Two-Way to One-Way Finite Automata—Three Regular Expression-Based Methods (Q2947420) (← links)
• STATE COMPLEXITY OF TWO COMBINED OPERATIONS: CATENATION-UNION AND CATENATION-INTERSECTION (Q3224949) (← links)
• NONDETERMINISTIC FINITE AUTOMATA — RECENT RESULTS ON THE DESCRIPTIONAL AND COMPUTATIONAL COMPLEXITY (Q3395129) (← links)
• OPTIMAL SIMULATIONS OF WEAK RESTARTING AUTOMATA (Q3526536) (← links)
• Distributed Timed Automata with Independently Evolving Clocks (Q3541012) (← links)
• Nondeterministic Finite Automata—Recent Results on the Descriptional and Computational Complexity (Q3602795) (← links)
• Size Complexity of Two-Way Finite Automata (Q3637213) (← links)
• Complexity results for multi-pebble automata and their logics (Q4632417) (← links)
• Two-way automata and length-preserving homomorphisms (Q4879206) (← links)
• (Q5091266) (← links)
• LIMITED AUTOMATA AND REGULAR LANGUAGES (Q5173292) (← links)
• (Q5376664) (← links)
• STATE COMPLEXITY AND THE MONOID OF TRANSFORMATIONS OF A FINITE SET (Q5462123) (← links)
• NONDETERMINISTIC DESCRIPTIONAL COMPLEXITY OF REGULAR LANGUAGES (Q5696955) (← links)
• THE PHENOMENON OF NON-RECURSIVE TRADE-OFFS (Q5704376) (← links)
• On the complexity of decision problems for some classes of machines and applications (Q6077841) (← links)
• On the transformation of two-way finite automata to unambiguous finite automata (Q6186312) (← links)