Pages that link to "Item:Q5462121"
From MaRDI portal
The following pages link to STATE COMPLEXITY OF CONCATENATION AND COMPLEMENTATION (Q5462121):
Displaying 42 items.
- State complexity of star of union and square of union on \textit{k} regular languages (Q391180) (← links)
- State complexity of combined operations for suffix-free regular languages (Q392179) (← links)
- State complexity of union and intersection of star on \(k\) regular languages (Q418766) (← links)
- State complexity of combined operations with two basic operations (Q441851) (← links)
- Concatenation of regular languages and descriptional complexity (Q639851) (← links)
- State complexity of union and intersection of square and reversal on \(k\) regular languages (Q714820) (← links)
- State complexity of power (Q1019718) (← links)
- Quotient complexity of closed languages (Q1678754) (← links)
- Descriptional complexity of regular languages (Q2074214) (← links)
- Combination of roots and Boolean operations: an application to state complexity (Q2105451) (← links)
- Estimation of state complexity of combined operations (Q2271462) (← links)
- State complexity of combined operations involving catenation and binary Boolean operations: beyond the Brzozowski conjectures (Q2333820) (← links)
- State complexity of unambiguous operations on finite automata (Q2334604) (← links)
- State complexity of combined operations (Q2383591) (← links)
- Complementing two-way finite automata (Q2643079) (← links)
- The Complexity of Languages Resulting from the Concatenation Operation (Q2829979) (← links)
- Undecidability of state complexity (Q2855756) (← links)
- Complexity in union-free regular languages (Q2909101) (← links)
- State complexity of two combined operations: catenation-star and catenation-reversal (Q2909180) (← links)
- State Complexity of Catenation Combined with Union and Intersection (Q3073626) (← links)
- MAGIC NUMBERS AND TERNARY ALPHABET (Q3086242) (← links)
- STATE COMPLEXITY OF TWO COMBINED OPERATIONS: CATENATION-UNION AND CATENATION-INTERSECTION (Q3224949) (← 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)
- ON THE STATE COMPLEXITY OF COMBINED OPERATIONS AND THEIR ESTIMATION (Q3503086) (← links)
- On the State Complexity of Complements, Stars, and Reversals of Regular Languages (Q3533030) (← links)
- STATE COMPLEXITY OF UNION AND INTERSECTION OF FINITE LANGUAGES (Q3538851) (← links)
- Nondeterministic Finite Automata—Recent Results on the Descriptional and Computational Complexity (Q3602795) (← links)
- Magic Numbers and Ternary Alphabet (Q3637234) (← 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)
- State Complexity of Four Combined Operations Composed of Union, Intersection, Star and Reversal (Q5200089) (← links)
- The complexity of concatenation on deterministic and alternating finite automata (Q5223613) (← links)
- State Complexity of <i>k</i>-Union and <i>k</i>-Intersection for Prefix-Free Regular Languages (Q5261608) (← links)
- State Complexity of Catenation Combined with a Boolean Operation: A Unified Approach (Q5298308) (← links)
- Operational State Complexity of Subtree-Free Regular Tree Languages (Q5298309) (← links)
- State complexity of deletion and bipolar deletion (Q5963404) (← links)
- Nondeterministic operational complexity in subregular languages (Q6093571) (← links)
- Quantitatively nonblocking supervisory control of discrete-event systems (Q6632516) (← links)