Enumerating regular expressions and their languages
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 2186886 (Why is no real title available?)
- scientific article; zbMATH DE number 3155303 (Why is no real title available?)
- scientific article; zbMATH DE number 3167394 (Why is no real title available?)
- scientific article; zbMATH DE number 5605090 (Why is no real title available?)
- scientific article; zbMATH DE number 3821741 (Why is no real title available?)
- scientific article; zbMATH DE number 3913686 (Why is no real title available?)
- scientific article; zbMATH DE number 3932372 (Why is no real title available?)
- scientific article; zbMATH DE number 3991807 (Why is no real title available?)
- scientific article; zbMATH DE number 3664335 (Why is no real title available?)
- scientific article; zbMATH DE number 3709588 (Why is no real title available?)
- scientific article; zbMATH DE number 3509728 (Why is no real title available?)
- scientific article; zbMATH DE number 3511563 (Why is no real title available?)
- scientific article; zbMATH DE number 3572315 (Why is no real title available?)
- scientific article; zbMATH DE number 1268810 (Why is no real title available?)
- scientific article; zbMATH DE number 1052006 (Why is no real title available?)
- scientific article; zbMATH DE number 2068873 (Why is no real title available?)
- scientific article; zbMATH DE number 1418342 (Why is no real title available?)
- scientific article; zbMATH DE number 3238653 (Why is no real title available?)
- scientific article; zbMATH DE number 3251424 (Why is no real title available?)
- scientific article; zbMATH DE number 3273201 (Why is no real title available?)
- A Census of Finite Automata
- A determinant of Stirling cycle numbers counts unlabeled acyclic single-source automata
- A note on the number of functional digraphs
- Analytic combinatorics
- Asymptotic enumeration of minimal automata
- Automaticity. I: Properties of a measure of descriptional complexity
- Automaticity. II: Descriptional complexity in the unary case
- Complexity measures for regular expressions
- Enumeration and generation with a string automata representation
- Enumeration and random generation of accessible automata
- Enumeration and random generation of possibly incomplete deterministic automata
- Enumeration of finite automata
- Enumeration of strongly connected sequential machines
- Exact enumeration of acyclic deterministic automata
- Follow automata.
- Generatingfunctionology
- Gröbner bases and the defining polynomial of a context-free grammar generating function
- IMPROVED BOUNDS ON THE NUMBER OF AUTOMATA ACCEPTING FINITE LANGUAGES
- Ideals, varieties, and algorithms. An introduction to computational algebraic geometry and commutative algebra
- Implementation and Application of Automata
- On the Average Size of Glushkov’s Automata
- On the asymptotic enumeration of accessible automata
- Regular expression for a language without empty word
- Regular expressions: new results and open problems
- Simplifying regular expressions. A quantitative perspective
- The number of functional digraphs
- \textit{Grail}: A C++ library for automata and expressions
Cited in
(7)- Inside the Class of REGEX Languages
- Regular languages and their generating functions: The inverse problem
- A technology for reverse-engineering a combinatorial problem from a rational generating function
- scientific article; zbMATH DE number 5671764 (Why is no real title available?)
- On minimizing regular expressions without Kleene star
- Enumerating regular expressions and their languages
- Enumerating \(m\)-length walks in directed graphs with constant delay
This page was built for publication: Enumerating regular expressions and their languages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2074215)
