Pages that link to "Item:Q5704377"

The following pages link to DESCRIPTIONAL COMPLEXITY OF NFA OF DIFFERENT AMBIGUITY (Q5704377):

Displaying 33 items.

• Unambiguous finite automata over a unary alphabet (Q418147) (← links)
• Descriptional complexity of unambiguous input-driven pushdown automata (Q484313) (← links)
• Two-way unary automata versus logarithmic space (Q549665) (← links)
• Lower bounds for the size of deterministic unranked tree automata (Q714828) (← links)
• On the state complexity of closures and interiors of regular languages with subwords and superwords (Q896684) (← links)
• Operational state complexity of unary NFAs with finite nondeterminism (Q896686) (← links)
• The containment problem for unambiguous register automata and unambiguous timed automata (Q2048204) (← links)
• On degrees of ambiguity for Büchi tree automata (Q2051784) (← links)
• Image-binary automata (Q2096597) (← links)
• Structural properties of NFAs and growth rates of nondeterminism measures (Q2113384) (← links)
• On the transformation of two-way deterministic finite automata to unambiguous finite automata (Q2232267) (← links)
• Ambiguity and structural ambiguity of symmetric difference NFAs (Q2453538) (← links)
• From finite automata to regular expressions and back -- a summary on descriptional complexity (Q2800411) (← links)
• Operations on Unambiguous Finite Automata (Q2817392) (← links)
• In memoriam Chandra Kintala (Q2909177) (← links)
• On the Determinization Blowup for Finite Automata Recognizing Equal-Length Languages (Q2944880) (← links)
• Ambiguity of Unary Symmetric Difference NFAs (Q3105754) (← links)
• Descriptional Complexity of Input-Driven Pushdown Automata (Q3166952) (← links)
• Width of Non-deterministic Automata (Q3304146) (← links)
• Operations on Unambiguous Finite Automata (Q4683235) (← links)
• A Superpolynomial Lower Bound for the Size of Non-Deterministic Complement of an Unambiguous Automaton (Q5002825) (← links)
• The Containment Problem for Unambiguous Register Automata (Q5090504) (← links)
• (Q5155680) (← links)
• (Q5207047) (← links)
• Worst Case Branching and Other Measures of Nondeterminism (Q5268392) (← links)
• Unambiguity in Automata Theory (Q5500675) (← links)
• Nondeterministic Tree Width of Regular Languages (Q5500678) (← links)
• The \(k\)-distinct language: parameterized automata constructions (Q5964071) (← links)
• Left is Better Than Right for Reducing Nondeterminism of NFAs (Q6114834) (← links)
• Converting finite width AFAs to nondeterministic and universal finite automata (Q6131195) (← links)
• On the transformation of two-way finite automata to unambiguous finite automata (Q6186312) (← links)
• Singly exponential translation of alternating weak Büchi automata to unambiguous Büchi automata (Q6562457) (← links)
• Descriptional complexity of finite automata -- selected highlights (Q6614536) (← links)