Pages that link to "Item:Q671381"
From MaRDI portal
The following pages link to A lower bound technique for the size of nondeterministic finite automata (Q671381):
Displaying 50 items.
- Extended regular expressions: succinctness and decidability (Q372977) (← links)
- Nondeterministic state complexity of star-free languages (Q442152) (← links)
- Succinctness of pattern-based schema languages for XML (Q532368) (← links)
- Descriptional and computational complexity of finite automata -- a survey (Q553312) (← links)
- Concatenation of regular languages and descriptional complexity (Q639851) (← links)
- Lower bounds for the size of deterministic unranked tree automata (Q714828) (← links)
- Lower bound for the number of states of purposeful deterministic automata (Q796993) (← links)
- Succinct description of regular languages by weak restarting automata (Q948085) (← links)
- Lower bounds for the transition complexity of NFAs (Q955341) (← links)
- Detecting palindromes, patterns and borders in regular languages (Q1041028) (← links)
- Lower bounds on the area of finite-state machines (Q1115595) (← links)
- Parameterized model checking of rendezvous systems (Q1635829) (← links)
- Size-treewidth tradeoffs for circuits computing the element distinctness function (Q1702852) (← links)
- On the descriptional complexity of finite automata with modified acceptance conditions (Q1763715) (← links)
- State complexity of some operations on binary regular languages (Q1763716) (← links)
- Descriptional complexity of regular languages (Q2074214) (← links)
- VC-dimensions of nondeterministic finite automata for words of equal length (Q2075374) (← links)
- State complexity of partial word finite automata (Q2096588) (← links)
- State complexity of finite partial languages (Q2112191) (← links)
- Oblivious two-way finite automata: decidability and complexity (Q2252534) (← links)
- Nondeterministic state complexity of nested word automata (Q2271435) (← links)
- On the limits of the communication complexity technique for proving lower bounds on the size of minimal NFA's (Q2271436) (← 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)
- Regular expressions for data words (Q2353403) (← links)
- More on deterministic and nondeterministic finite cover automata (Q2357103) (← links)
- Transition complexity of language operations (Q2465047) (← links)
- On the average state and transition complexity of finite languages (Q2465048) (← links)
- Operations on Unambiguous Finite Automata (Q2817392) (← links)
- Self-Verifying Finite Automata and Descriptional Complexity (Q2829967) (← links)
- Descriptional Complexity of Bounded Regular Languages (Q2829978) (← links)
- Nondeterministic Complexity of Operations on Closed and Ideal Languages (Q2830213) (← links)
- Complexity in union-free regular languages (Q2909101) (← links)
- The magic number problem for subregular language families (Q2909186) (← links)
- More on Deterministic and Nondeterministic Finite Cover Automata (Q2947414) (← links)
- Classes of two-dimensional languages and recognizability conditions (Q2998728) (← links)
- Comparing Necessary Conditions for Recognizability of Two-Dimensional Languages (Q3014932) (← links)
- MAGIC NUMBERS AND TERNARY ALPHABET (Q3086242) (← links)
- Descriptional Complexity of Input-Driven Pushdown Automata (Q3166952) (← links)
- Querying Regular Graph Patterns (Q3189642) (← links)
- Satisfiability for SCULPT-schemas for CSV-like data (Q3305360) (← 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)
- A Nontrivial Lower Bound for an NP Problem on Automata (Q3477958) (← links)
- State complexity of cyclic shift (Q3515466) (← links)
- On the Hardness of Determining Small NFA’s and of Proving Lower Bounds on Their Sizes (Q3532998) (← links)
- On the State Complexity of Complements, Stars, and Reversals of Regular Languages (Q3533030) (← links)
- DETERMINISTIC BLOW-UPS OF MINIMAL NONDETERMINISTIC FINITE AUTOMATA OVER A FIXED ALPHABET (Q3538853) (← links)
