Pages that link to "Item:Q1763716"
From MaRDI portal
The following pages link to State complexity of some operations on binary regular languages (Q1763716):
Displaying 21 items.
- DETERMINISTIC BLOW-UPS OF MINIMAL NONDETERMINISTIC FINITE AUTOMATA OVER A FIXED ALPHABET (Q3538853) (← links)
- Nondeterministic Finite Automata—Recent Results on the Descriptional and Computational Complexity (Q3602795) (← links)
- State Complexity of Nested Word Automata (Q3618567) (← links)
- Operations on Unambiguous Finite Automata (Q4683235) (← links)
- (Q5020533) (← links)
- A Study of a Simple Class of Modifiers: Product Modifiers (Q5041253) (← links)
- (Q5130744) (← links)
- THE RANGES OF STATE COMPLEXITIES FOR COMPLEMENT, STAR, AND REVERSAL OF REGULAR LANGUAGES (Q5168427) (← links)
- Nondeterministic State Complexity of Star-Free Languages (Q5200063) (← links)
- State Complexity of Four Combined Operations Composed of Union, Intersection, Star and Reversal (Q5200089) (← links)
- Most Complex Non-Returning Regular Languages (Q5205037) (← links)
- The complexity of concatenation on deterministic and alternating finite automata (Q5223613) (← links)
- State Complexity of Catenation Combined with a Boolean Operation: A Unified Approach (Q5298308) (← links)
- STATE COMPLEXITY OF CONCATENATION AND COMPLEMENTATION (Q5462121) (← links)
- Implementation and Application of Automata (Q5463982) (← links)
- Complement on Free and Ideal Languages (Q5500692) (← links)
- Transducing Markov sequences (Q5501935) (← links)
- State complexity of deletion and bipolar deletion (Q5963404) (← links)
- Nondeterministic operational complexity in subregular languages (Q6093571) (← links)
- A Survey on Fooling Sets as Effective Tools for Lower Bounds on Nondeterministic Complexity (Q6163615) (← links)
- Iterative arrays with self-verifying communication cell (Q6195133) (← links)
