Pages that link to "Item:Q3618617"

The following pages link to On the Average Size of Glushkov’s Automata (Q3618617):

Displaying 20 items.

• Automata for regular expressions with shuffle (Q1706150) (← links)
• On the size of partial derivatives and the word membership problem (Q2041687) (← links)
• Enumerating regular expressions and their languages (Q2074215) (← links)
• On the uniform distribution of regular expressions (Q2096580) (← links)
• Partial derivative automaton by compressing regular expressions (Q2096587) (← links)
• Manipulation of regular expressions using derivatives: an overview (Q2164731) (← links)
• How to settle the ReDoS problem: back to the classical automata theory (Q2164733) (← links)
• A hitchhiker's guide to descriptional complexity through analytic combinatorics (Q2437857) (← links)
• On the average complexity of partial derivative transducers (Q2699218) (← links)
• On the Uniform Random Generation of Non Deterministic Automata Up to Isomorphism (Q2947416) (← links)
• Prefix and Right-Partial Derivative Automata (Q3195704) (← links)
• On the Average State Complexity of Partial Derivative Transducers (Q3297766) (← links)
• On the Degeneracy of Random Expressions Specified by Systems of Combinatorial Equations (Q5041257) (← links)
• (Q5061515) (← links)
• (Q5092413) (← links)
• On Average Behaviour of Regular Expressions in Strong Star Normal Form (Q5205036) (← links)
• The Bottom-Up Position Tree Automaton and the Father Automaton (Q5859662) (← links)
• Random Regular Expression Over Huge Alphabets (Q6114829) (← links)
• The effects of semantic simplifications on random \textit{BST}-like expression-trees (Q6124452) (← links)
• Simplifications of Uniform Expressions Specified by Systems (Q6169899) (← links)