Pages that link to "Item:Q5696955"
From MaRDI portal
The following pages link to NONDETERMINISTIC DESCRIPTIONAL COMPLEXITY OF REGULAR LANGUAGES (Q5696955):
Displaying 50 items.
- Descriptional complexity of bounded context-free languages (Q383365) (← links)
- State complexity of combined operations for suffix-free regular languages (Q392179) (← links)
- Unambiguous finite automata over a unary alphabet (Q418147) (← links)
- Nondeterministic state complexity of star-free languages (Q442152) (← links)
- The size-cost of Boolean operations on constant height deterministic pushdown automata (Q443731) (← links)
- State complexity of operations on two-way finite automata over a unary alphabet (Q443746) (← links)
- The pseudopalindromic completion of regular languages (Q476182) (← links)
- Descriptional complexity of unambiguous input-driven pushdown automata (Q484313) (← links)
- On the state complexity of operations on two-way finite automata (Q515574) (← links)
- Two double-exponential gaps for automata with a limited pushdown (Q515677) (← links)
- Descriptional and computational complexity of finite automata -- a survey (Q553312) (← links)
- Limitations of lower bound methods for deterministic nested word automata (Q553328) (← links)
- Concatenation of regular languages and descriptional complexity (Q639851) (← links)
- State complexity of inversion operations (Q896671) (← 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)
- Lower bounds for the transition complexity of NFAs (Q955341) (← links)
- State complexity of power (Q1019718) (← links)
- State complexity of unique rational operations (Q1019724) (← links)
- State complexity of basic operations on suffix-free regular languages (Q1029324) (← links)
- State complexity of some operations on binary regular languages (Q1763716) (← links)
- Complementing unary nondeterministic automata (Q1763723) (← links)
- Power, positive closure, and quotients on convex languages (Q2029485) (← links)
- Descriptional complexity of regular languages (Q2074214) (← links)
- State complexity of partial word finite automata (Q2096588) (← links)
- State complexity of union and intersection on graph-walking automata (Q2096590) (← links)
- Image-binary automata (Q2096597) (← links)
- Operations on subregular languages and nondeterministic state complexity (Q2112186) (← links)
- State complexity of finite partial languages (Q2112191) (← links)
- Nondeterministic state complexity of nested word automata (Q2271435) (← links)
- Estimation of state complexity of combined operations (Q2271462) (← links)
- Operational state complexity of nested word automata (Q2271464) (← links)
- Nondeterministic complexity in subclasses of convex languages (Q2319915) (← links)
- State complexity of unambiguous operations on finite automata (Q2334604) (← links)
- State complexity of permutation on finite languages over a binary alphabet (Q2358683) (← links)
- The chop of languages (Q2358686) (← links)
- State complexity of operations on input-driven pushdown automata (Q2396831) (← links)
- Nondeterministic complexity of operations on free and convex languages (Q2399254) (← links)
- Transition complexity of language operations (Q2465047) (← links)
- Operations on Unambiguous Finite Automata (Q2817392) (← links)
- Self-Verifying Finite Automata and Descriptional Complexity (Q2829967) (← links)
- Nondeterministic Complexity of Operations on Closed and Ideal Languages (Q2830213) (← links)
- Undecidability of state complexity (Q2855756) (← links)
- State Complexity of Insertion (Q2970209) (← links)
- Descriptional Complexity of Input-Driven Pushdown Automata (Q3166952) (← links)
- Concatenation of Regular Languages and Descriptional Complexity (Q3392955) (← links)
- NONDETERMINISTIC FINITE AUTOMATA — RECENT RESULTS ON THE DESCRIPTIONAL AND COMPUTATIONAL COMPLEXITY (Q3395129) (← links)
- Deterministic blow-ups of minimal NFA's (Q3421910) (← links)
- ON THE STATE COMPLEXITY OF COMBINED OPERATIONS AND THEIR ESTIMATION (Q3503086) (← links)
- State complexity of cyclic shift (Q3515466) (← links)
