Ambiguity in Graphs and Expressions
From MaRDI portal
Cited in
(26)- State complexity of unique rational operations
- The base of the intersection of two free submonoids
- Regular expressions into finite automata
- The validation of SGML content models
- Translation of binary regular expressions into nondeterministic \(\varepsilon\)-free automata with \(O(n\log n)\) transitions
- The inclusion problem for regular expressions
- Attribute grammars for unranked trees as a query language for structured documents
- Algebraic aspects of families of fuzzy languages
- Valuations, regular expressions, and fractal geometry
- A deterministic parsing algorithm for ambiguous regular expressions
- Solving string problems on graphs using the labeled direct product
- Automata-based symbolic string analysis for vulnerability detection
- Comparing the size of NFAs with and without \(\epsilon\)-transitions
- A homomorphism theorem for weighted context-free grammars
- Free and almost-free subsemigroups of a free semigroup
- From finite automata to regular expressions and back -- a summary on descriptional complexity
- Regular Programming for Quantitative Properties of Data Streams
- From ambiguous regular expressions to deterministic parsing automata
- Deterministic Caterpillar Expressions
- From regular expressions to finite automata∗
- Translating regular expressions into small -free nondeterministic finite automata
- Deterministic regular languages
- One-unambiguous regular languages
- One-unambiguous regular languages
- Translating regular expressions into small \(\epsilon\)-free nondeterministic finite automata
- Deciding determinism of caterpillar expressions
This page was built for publication: Ambiguity in Graphs and Expressions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5628042)
