The following pages link to (Q4040284):
Displaying 33 items.
- Approximate matching between a context-free grammar and a finite-state automaton (Q259082) (← links)
- Postfix automata (Q476910) (← links)
- The language intersection problem for non-recursive context-free grammars (Q596298) (← links)
- Partial derivatives of regular expressions and finite automaton constructions (Q672142) (← links)
- Computation of distances for regular and context-free probabilistic languages (Q932320) (← links)
- The IELR(1) algorithm for generating minimal LR(1) parser tables for non-LR(1) grammars with conflict resolution (Q988183) (← links)
- Producing the left parse during bottom-up parsing (Q1044742) (← links)
- Regular expressions into finite automata (Q1314367) (← links)
- Simulation of one-dimensional cellular automata by uniquely parallel parsable grammars. (Q1401396) (← links)
- Translation of binary regular expressions into nondeterministic \(\varepsilon\)-free automata with \(O(n\log n)\) transitions (Q1401956) (← links)
- A characterization of Thompson digraphs. (Q1421476) (← links)
- Follow automata. (Q1426009) (← links)
- Bounded-connect noncanonical discriminating-reverse parsers. (Q1426162) (← links)
- Reducing NFAs by invariant equivalences. (Q1426461) (← links)
- Size/lookahead tradeoff for \(LL(k)\)-grammars (Q1603369) (← links)
- Reasoning about strings in databases (Q1807679) (← links)
- P-hardness of the emptiness problem for visibly pushdown languages (Q1944895) (← links)
- Bottom-up unranked tree-to-graph transducers for translation into semantic graphs (Q2029483) (← links)
- Descriptional complexity of regular languages (Q2074214) (← links)
- Checking determinism of regular expressions with counting (Q2343138) (← links)
- One-unambiguity of regular expressions with numeric occurrence indicators (Q2373702) (← links)
- Comparing the size of NFAs with and without \(\epsilon\)-transitions (Q2373739) (← links)
- Measuring nondeterminism in pushdown automata (Q2575832) (← links)
- Parsing Beyond Context-Free Grammars (Q2785998) (← links)
- Conversion of regular expressions into realtime automata (Q3423141) (← links)
- On the Hardness of Determining Small NFA’s and of Proving Lower Bounds on Their Sizes (Q3532998) (← links)
- On the computational complexity of algebraic numbers: the Hartmanis–Stearns problem revisited (Q4960229) (← links)
- A Superpolynomial Lower Bound for the Size of Non-Deterministic Complement of an Unambiguous Automaton (Q5002825) (← links)
- Translating regular expressions into small ε-free nondeterministic finite automata (Q5047159) (← links)
- Measuring nondeterminism in pushdown automata (Q5048932) (← links)
- Graph Parsing as Graph Transformation (Q5100735) (← links)
- Translating regular expressions into small \(\epsilon\)-free nondeterministic finite automata (Q5946055) (← links)
- On parsing LL-languages (Q5958724) (← links)
