The following pages link to (Q5437181):
Displayed 41 items.
- On the sizes of DPDAs, PDAs, LBAs (Q294936) (← links)
- Series parallel digraphs with loops (Q372966) (← links)
- Decision problems for convex languages (Q553302) (← links)
- Multi-tilde-bar expressions and their automata (Q715057) (← links)
- Succinctness of regular expressions with interleaving, intersection and counting (Q982670) (← links)
- State complexity of unique rational operations (Q1019724) (← links)
- On NFAs where all states are final, initial, or both (Q1034621) (← links)
- Lower bounds for context-free grammars (Q1944159) (← links)
- Acyclic automata and small expressions using multi-tilde-bar operators (Q1959650) (← links)
- Complexity of universality and related problems for partially ordered NFAs (Q2013561) (← links)
- Operational complexity and right linear grammars (Q2041682) (← links)
- Reversibility for stateless ordered RRWW-automata (Q2041689) (← links)
- Descriptional complexity of regular languages (Q2074214) (← links)
- Enumerating regular expressions and their languages (Q2074215) (← links)
- Defining long words succinctly in FO and MSO (Q2104260) (← links)
- Efficient enumeration of regular expressions for faster regular expression synthesis (Q2117664) (← links)
- On minimizing regular expressions without Kleene star (Q2140503) (← links)
- Language operations with regular expressions of polynomial size (Q2271463) (← links)
- On Boolean combinations forming piecewise testable languages (Q2358689) (← links)
- A hitchhiker's guide to descriptional complexity through analytic combinatorics (Q2437857) (← links)
- State Complexity of Kleene-Star Operations on Trees (Q2891328) (← links)
- Finite Automata, Digraph Connectivity, and Regular Expression Size (Q3520302) (← links)
- The Frobenius Problem and Its Generalizations (Q3533000) (← links)
- The Average State Complexity of the Star of a Finite Set of Words Is Linear (Q3533005) (← links)
- Provably Shorter Regular Expressions from Deterministic Finite Automata (Q3533026) (← links)
- A New Family of Regular Operators Fitting with the Position Automaton Computation (Q3599111) (← links)
- Antimirov and Mosses’s Rewrite System Revisited (Q3602800) (← links)
- Multi-tilde Operators and Their Glushkov Automata (Q3618589) (← links)
- Closures in Formal Languages and Kuratowski’s Theorem (Q3637219) (← links)
- Tight Bounds on the Descriptional Complexity of Regular Expressions (Q3637232) (← links)
- Short Regular Expressions from Finite Automata: Empirical Results (Q3637356) (← links)
- Small Extended Expressions for Acyclic Automata (Q3637357) (← links)
- (Q4989409) (← links)
- (Q5092323) (← links)
- On the Length of Shortest Strings Accepted by Two-way Finite Automata (Q5158651) (← links)
- Decidability and Shortest Strings in Formal Languages (Q5200081) (← links)
- Optimal Lower Bounds on Regular Expression Size Using Communication Complexity (Q5458365) (← links)
- The State Complexity of Permutations on Finite Languages over Binary Alphabets (Q5500695) (← links)
- Further Remarks on the Operational Nonterminal Complexity (Q6114830) (← links)
- Identities and periodic oscillations of divide-and-conquer recurrences splitting at half (Q6153612) (← links)
- Shortest accepted strings for two-way finite automata: approaching the \(2^n\) lower bound (Q6175095) (← links)