scientific article; zbMATH DE number 193480
From MaRDI portal
Publication:4040284
Recommendations
- scientific article; zbMATH DE number 194074
- scientific article; zbMATH DE number 1452980
- scientific article; zbMATH DE number 4100631
- scientific article; zbMATH DE number 1696588
- Grammar semantics, analysis and parsing by abstract interpretation
- scientific article; zbMATH DE number 3474967
- Parsing beyond context-free grammars
- On parsing LL-languages
- Parsing as abstract interpretation of grammar semantics
- scientific article; zbMATH DE number 444435
Cited in
(38)- Producing the left parse during bottom-up parsing
- Regular expressions into finite automata
- Simulation of one-dimensional cellular automata by uniquely parallel parsable grammars.
- Translation of binary regular expressions into nondeterministic \(\varepsilon\)-free automata with \(O(n\log n)\) transitions
- A characterization of Thompson digraphs.
- Follow automata.
- Bounded-connect noncanonical discriminating-reverse parsers.
- Reducing NFAs by invariant equivalences.
- Size/lookahead tradeoff for \(LL(k)\)-grammars
- Reasoning about strings in databases
- P-hardness of the emptiness problem for visibly pushdown languages
- Bottom-up unranked tree-to-graph transducers for translation into semantic graphs
- Descriptional complexity of regular languages
- Checking determinism of regular expressions with counting
- One-unambiguity of regular expressions with numeric occurrence indicators
- Comparing the size of NFAs with and without \(\epsilon\)-transitions
- Measuring nondeterminism in pushdown automata
- Approximate matching between a context-free grammar and a finite-state automaton
- Parsing beyond context-free grammars
- scientific article; zbMATH DE number 444435 (Why is no real title available?)
- Conversion of regular expressions into realtime automata
- On the Hardness of Determining Small NFA’s and of Proving Lower Bounds on Their Sizes
- scientific article; zbMATH DE number 4100631 (Why is no real title available?)
- scientific article; zbMATH DE number 194074 (Why is no real title available?)
- Postfix automata
- On the computational complexity of algebraic numbers: the Hartmanis-Stearns problem revisited
- A superpolynomial lower bound for the size of non-deterministic complement of an unambiguous automaton
- Translating regular expressions into small -free nondeterministic finite automata
- Measuring nondeterminism in pushdown automata
- Graph parsing as graph transformation. Correctness of predictive top-down parsers
- Translating regular expressions into small \(\epsilon\)-free nondeterministic finite automata
- On parsing LL-languages
- The language intersection problem for non-recursive context-free grammars
- Partial derivatives of regular expressions and finite automaton constructions
- Parsing as a lifting problem and the Chomsky-Schützenberger representation theorem
- The categorical contours of the Chomsky-Schützenberger representation theorem
- Computation of distances for regular and context-free probabilistic languages
- The IELR(1) algorithm for generating minimal LR(1) parser tables for non-LR(1) grammars with conflict resolution
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4040284)
