Pages that link to "Item:Q596099"

The following pages link to On the state complexity of reversals of regular languages (Q596099):

Displaying 34 items.

• Closure properties and descriptional complexity of deterministic regular expressions (Q265078) (← links)
• State complexity of combined operations for suffix-free regular languages (Q392179) (← links)
• An alternating hierarchy for finite automata (Q442279) (← links)
• Reversal of binary regular languages (Q443743) (← links)
• Concatenation of regular languages and descriptional complexity (Q639851) (← links)
• Prefix-free languages: left and right quotient and reversal (Q896681) (← links)
• State complexity of basic language operations combined with reversal (Q948089) (← links)
• State complexity of basic operations on suffix-free regular languages (Q1029324) (← links)
• Descriptional complexity of regular languages (Q2074214) (← links)
• Operational state complexity of nested word automata (Q2271464) (← links)
• Primitivity, uniform minimality, and state complexity of Boolean operations (Q2322701) (← links)
• Magic numbers in the state hierarchy of finite automata (Q2461796) (← links)
• Undecidability of state complexity (Q2855756) (← links)
• COMPLEXITY IN UNION-FREE REGULAR LANGUAGES (Q2909101) (← links)
• On the State and Computational Complexity of the Reverse of Acyclic Minimal DFAs (Q2914712) (← links)
• Translation from classical two-way automata to pebble two-way automata (Q2998731) (← links)
• State Complexity of Catenation Combined with Union and Intersection (Q3073626) (← links)
• Undecidability of State Complexities Using Mirror Images (Q3166954) (← links)
• Concatenation of Regular Languages and Descriptional Complexity (Q3392955) (← links)
• NONDETERMINISTIC FINITE AUTOMATA — RECENT RESULTS ON THE DESCRIPTIONAL AND COMPUTATIONAL COMPLEXITY (Q3395129) (← links)
• State Complexity of Boundary of Prefix-Free Regular Languages (Q3455750) (← links)
• State complexity of cyclic shift (Q3515466) (← links)
• Nondeterministic Finite Automata—Recent Results on the Descriptional and Computational Complexity (Q3602795) (← links)
• State Complexity of Combined Operations for Prefix-Free Regular Languages (Q3618598) (← links)
• State Complexity of Four Combined Operations Composed of Union, Intersection, Star and Reversal (Q5200089) (← links)
• Note on Reversal of Binary Regular Languages (Q5200093) (← links)
• State Complexity of <i>k</i>-Union and <i>k</i>-Intersection for Prefix-Free Regular Languages (Q5261608) (← links)
• (Q5376657) (← links)
• IN SEARCH OF MOST COMPLEX REGULAR LANGUAGES (Q5401550) (← links)
• COMPLEXITY OF ATOMS OF REGULAR LANGUAGES (Q5495417) (← links)
• Lower Bound Methods for the Size of Nondeterministic Finite Automata Revisited (Q5739002) (← links)
• Descriptional complexity of iterated uniform finite-state transducers (Q5918615) (← links)
• State complexity of deletion and bipolar deletion (Q5963404) (← links)
• On the minimal faithful degree of Rhodes semisimple semigroups (Q6170778) (← links)