Pages that link to "Item:Q2719119"

The following pages link to Optimal Simulations between Unary Automata (Q2719119):

Displaying 45 items.

• Unambiguous finite automata over a unary alphabet (Q418147) (← links)
• Nondeterministic state complexity of star-free languages (Q442152) (← links)
• An alternating hierarchy for finite automata (Q442279) (← links)
• State complexity of operations on two-way finite automata over a unary alphabet (Q443746) (← links)
• Descriptional complexity of two-way pushdown automata with restricted head reversals (Q443747) (← links)
• On the state complexity of operations on two-way finite automata (Q515574) (← links)
• Descriptional and computational complexity of finite automata -- a survey (Q553312) (← links)
• Iterated uniform finite-state transducers on unary languages (Q831808) (← links)
• Converting two-way nondeterministic unary automata into simpler automata. (Q1401239) (← links)
• Translation of binary regular expressions into nondeterministic \(\varepsilon\)-free automata with \(O(n\log n)\) transitions (Q1401956) (← links)
• Descriptional complexity of limited automata (Q1706157) (← links)
• On the descriptional power of heads, counters, and pebbles (Q1763719) (← links)
• Complementing unary nondeterministic automata (Q1763723) (← links)
• Unary context-free grammars and pushdown automata, descriptional complexity and auxiliary space lower bounds. (Q1872711) (← links)
• The descriptional power of queue automata of constant length (Q2041686) (← links)
• Descriptional complexity of regular languages (Q2074214) (← links)
• Deterministic one-way simulation of two-way deterministic finite automata over small alphabets (Q2096581) (← links)
• State complexity of GF(2)-operations on unary languages (Q2113387) (← links)
• On the transformation of two-way deterministic finite automata to unambiguous finite automata (Q2232267) (← links)
• Removing nondeterminism in constant height pushdown automata (Q2252532) (← links)
• Oblivious two-way finite automata: decidability and complexity (Q2252534) (← links)
• Pairs of complementary unary languages with ``balanced'' nondeterministic automata (Q2429361) (← links)
• Magic numbers in the state hierarchy of finite automata (Q2461796) (← links)
• A Space Lower Bound for Acceptance by One-Way Π₂-Alternating Machines (Q2720409) (← links)
• IN MEMORIAM CHANDRA KINTALA (Q2909177) (← 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)
• Translation from classical two-way automata to pebble two-way automata (Q2998731) (← links)
• Note on the Succinctness of Deterministic, Nondeterministic, Probabilistic and Quantum Finite Automata (Q3149086) (← links)
• Descriptional Complexity of Input-Driven Pushdown Automata (Q3166952) (← links)
• NONDETERMINISTIC FINITE AUTOMATA — RECENT RESULTS ON THE DESCRIPTIONAL AND COMPUTATIONAL COMPLEXITY (Q3395129) (← links)
• DETERMINISTIC PUSHDOWN AUTOMATA AND UNARY LANGUAGES (Q3395134) (← links)
• TESTING THE DESCRIPTIONAL POWER OF SMALL TURING MACHINES ON NONREGULAR LANGUAGE ACCEPTANCE (Q3526538) (← links)
• Hyper-minimizing minimized deterministic finite state automata (Q3549289) (← links)
• Nondeterministic Finite Automata—Recent Results on the Descriptional and Computational Complexity (Q3602795) (← links)
• Deterministic Pushdown Automata and Unary Languages (Q3602818) (← links)
• Descriptional and Computational Complexity of Finite Automata (Q3618565) (← links)
• SIMULATIONS OF UNARY ONE-WAY MULTI-HEAD FINITE AUTOMATA (Q5173291) (← links)
• LIMITED AUTOMATA AND REGULAR LANGUAGES (Q5173292) (← links)
• On Simulation Cost of Unary Limited Automata (Q5500689) (← links)
• NONDETERMINISTIC DESCRIPTIONAL COMPLEXITY OF REGULAR LANGUAGES (Q5696955) (← links)
• Investigations on Automata and Languages Over a Unary Alphabet (Q5744124) (← links)
• Pushdown automata and constant height: decidability and bounds (Q6042073) (← links)
• Iterated uniform finite-state transducers on unary languages (Q6165558) (← links)
• On the transformation of two-way finite automata to unambiguous finite automata (Q6186312) (← links)