Pages that link to "Item:Q5638224"

The following pages link to On the Bounds for State-Set Size in the Proofs of Equivalence Between Deterministic, Nondeterministic, and Two-Way Finite Automata (Q5638224):

Displaying 50 items.

• Converting nondeterministic automata and context-free grammars into Parikh equivalent one-way and two-way deterministic automata (Q388216) (← links)
• Nondeterministic state complexity of star-free languages (Q442152) (← links)
• An alternating hierarchy for finite automata (Q442279) (← links)
• On a structural property in the state complexity of projected regular languages (Q443744) (← 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)
• Optimal simulation of self-verifying automata by deterministic automata (Q553320) (← links)
• Complexity of multi-head finite automata: origins and directions (Q616495) (← links)
• Lower bounds for the size of deterministic unranked tree automata (Q714828) (← links)
• Regular languages of partial words (Q726150) (← links)
• State complexity of inversion operations (Q896671) (← links)
• Operational state complexity of unary NFAs with finite nondeterminism (Q896686) (← links)
• On NFAs where all states are final, initial, or both (Q1034621) (← links)
• Bounds on the index and period of a binary relation on a finite set (Q1236195) (← links)
• Equivalence problem of non-deterministic finite automata (Q1255319) (← links)
• Transforming a single-valued transducer into a Mealy machine (Q1267709) (← links)
• Succinctness of descriptions of SBTA-languages (Q1391741) (← links)
• A family of NFAs which need 2\(^{n}-\alpha\) deterministic states (Q1400001) (← links)
• Tight bounds on the number of states of DFAs that are equivalent to \(n\)-state NFAs (Q1566750) (← links)
• Tight lower bounds on the size of sweeping automata (Q1604196) (← links)
• Empirical studies in the size of diagnosers and verifiers for diagnosability analysis (Q1686857) (← links)
• On the descriptional complexity of finite automata with modified acceptance conditions (Q1763715) (← links)
• State complexity of some operations on binary regular languages (Q1763716) (← links)
• Complementing unary nondeterministic automata (Q1763723) (← links)
• Communication complexity method for measuring nondeterminism in finite automata (Q1854501) (← links)
• An \(n\log n\) algorithm for hyper-minimizing a (minimized) deterministic automaton (Q1959648) (← links)
• Descriptional complexity of regular languages (Q2074214) (← links)
• Deterministic one-way simulation of two-way deterministic finite automata over small alphabets (Q2096581) (← 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)
• Determination of finite automata accepting subregular languages (Q2271457) (← links)
• More on deterministic and nondeterministic finite cover automata (Q2357103) (← links)
• Pairs of complementary unary languages with ``balanced'' nondeterministic automata (Q2429361) (← links)
• Ambiguity and structural ambiguity of symmetric difference NFAs (Q2453538) (← links)
• Magic numbers in the state hierarchy of finite automata (Q2461796) (← links)
• Complementing two-way finite automata (Q2643079) (← links)
• From Finite Automata to Regular Expressions and Back — A Summary on Descriptional Complexity (Q2800411) (← links)
• Self-Verifying Finite Automata and Descriptional Complexity (Q2829967) (← links)
• On the Determinization Blowup for Finite Automata Recognizing Equal-Length Languages (Q2944880) (← links)
• State Complexity of Regular Tree Languages for Tree Matching (Q2974061) (← links)
• Translation from classical two-way automata to pebble two-way automata (Q2998731) (← links)
• UNARY LANGUAGE OPERATIONS, STATE COMPLEXITY AND JACOBSTHAL'S FUNCTION (Q3021944) (← links)
• Better Hyper-minimization (Q3073639) (← links)
• Ambiguity of Unary Symmetric Difference NFAs (Q3105754) (← links)
• Note on the Succinctness of Deterministic, Nondeterministic, Probabilistic and Quantum Finite Automata (Q3149086) (← links)
• Deterministic blow-ups of minimal NFA's (Q3421910) (← links)
• Note on the complexity of Las Vegas automata problems (Q3421911) (← 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)
• Descriptional and Computational Complexity of Finite Automata (Q3618565) (← links)