Pages that link to "Item:Q1763723"

The following pages link to Complementing unary nondeterministic automata (Q1763723):

Displaying 17 items.

• Reversal of binary regular languages (Q443743) (← links)
• Some results on the structure of unary unambiguous automata (Q544137) (← links)
• Optimal simulation of self-verifying automata by deterministic automata (Q553320) (← links)
• Operational state complexity of unary NFAs with finite nondeterminism (Q896686) (← links)
• Descriptional complexity of limited automata (Q1706157) (← links)
• Descriptional complexity of regular languages (Q2074214) (← links)
• Pairs of complementary unary languages with ``balanced'' nondeterministic automata (Q2429361) (← links)
• Transition complexity of language operations (Q2465047) (← links)
• Complementing two-way finite automata (Q2643079) (← links)
• NONDETERMINISTIC FINITE AUTOMATA — RECENT RESULTS ON THE DESCRIPTIONAL AND COMPUTATIONAL COMPLEXITY (Q3395129) (← links)
• Nondeterministic Finite Automata—Recent Results on the Descriptional and Computational Complexity (Q3602795) (← links)
• Converting Self-verifying Automata into Deterministic Automata (Q3618603) (← links)
• A Superpolynomial Lower Bound for the Size of Non-Deterministic Complement of an Unambiguous Automaton (Q5002825) (← links)
• SIMULATIONS OF UNARY ONE-WAY MULTI-HEAD FINITE AUTOMATA (Q5173291) (← links)
• Note on Reversal of Binary Regular Languages (Q5200093) (← links)
• On Simulation Cost of Unary Limited Automata (Q5500689) (← links)
• Investigations on Automata and Languages Over a Unary Alphabet (Q5744124) (← links)