On the Degeneracy of Random Expressions Specified by Systems of Combinatorial Equations

DOI10.1007/978-3-030-48516-0_13OpenAlexW3029282306MaRDI QIDQ5041257

Cyril Nicaud, Florent Koechlin, Pablo Rotondo

Publication date: 13 October 2022

Published in: Developments in Language Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-030-48516-0_13

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (4)

Random Regular Expression Over Huge Alphabets ⋮ The effects of semantic simplifications on random \textit{BST}-like expression-trees ⋮ Simplifications of Uniform Expressions Specified by Systems ⋮ On the uniform distribution of regular expressions

Cites Work

• Algorithms for combinatorial structures: well-founded systems and Newton iterations
• On an asymptotic method in enumeration
• Characteristic points of recursive systems
• Random Trees
• On the Average Size of Glushkov’s Automata
• A complexity calculus for recursive tree algorithms
• Formulae and Asymptotics for Coefficients of Algebraic Functions
• Implementation and Application of Automata
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the Degeneracy of Random Expressions Specified by Systems of Combinatorial Equations