Pages that link to "Item:Q5628042"

The following pages link to Ambiguity in Graphs and Expressions (Q5628042):

Displaying 21 items.

• Deciding determinism of caterpillar expressions (Q840761) (← links)
• State complexity of unique rational operations (Q1019724) (← links)
• The base of the intersection of two free submonoids (Q1070043) (← links)
• Regular expressions into finite automata (Q1314367) (← links)
• The validation of SGML content models (Q1370524) (← links)
• Translation of binary regular expressions into nondeterministic \(\varepsilon\)-free automata with \(O(n\log n)\) transitions (Q1401956) (← links)
• The inclusion problem for regular expressions (Q1757837) (← links)
• Attribute grammars for unranked trees as a query language for structured documents (Q1776378) (← links)
• Algebraic aspects of families of fuzzy languages (Q1870578) (← links)
• Valuations, regular expressions, and fractal geometry (Q1908904) (← links)
• A deterministic parsing algorithm for ambiguous regular expressions (Q2035007) (← links)
• Solving string problems on graphs using the labeled direct product (Q2088591) (← links)
• Automata-based symbolic string analysis for vulnerability detection (Q2248096) (← links)
• Comparing the size of NFAs with and without \(\epsilon\)-transitions (Q2373739) (← links)
• A homomorphism theorem for weighted context-free grammars (Q2554955) (← links)
• Free and almost-free subsemigroups of a free semigroup (Q2557798) (← links)
• From Finite Automata to Regular Expressions and Back — A Summary on Descriptional Complexity (Q2800411) (← links)
• Regular Programming for Quantitative Properties of Data Streams (Q2802466) (← links)
• Derivative-Based Diagnosis of Regular Expression Ambiguity (Q2830226) (← links)
• From Ambiguous Regular Expressions to Deterministic Parsing Automata (Q2947407) (← links)
• Translating regular expressions into small ε-free nondeterministic finite automata (Q5047159) (← links)