Enumerating regular expressions and their languages
From MaRDI portal
Publication:2074215
DOI10.4171/Automata-1/13MaRDI QIDQ2074215
Publication date: 4 February 2022
Full work available at URL: https://arxiv.org/abs/1204.4982
Related Items
Uses Software
Cites Work
- The number of functional digraphs
- A note on the number of functional digraphs
- Enumeration and random generation of accessible automata
- Complexity measures for regular expressions
- \textit{Grail}: A C++ library for automata and expressions
- Regular expression for a language without empty word
- Automaticity. II: Descriptional complexity in the unary case
- Follow automata.
- Automaticity. I: Properties of a measure of descriptional complexity
- Enumeration and generation with a string automata representation
- Exact enumeration of acyclic deterministic automata
- Asymptotic enumeration of Minimal Automata
- Simplifying Regular Expressions
- A determinant of Stirling cycle numbers counts unlabeled acyclic single-source automata
- On the Average Size of Glushkov’s Automata
- Enumeration of strongly connected sequential machines
- Implementation and Application of Automata
- A Census of Finite Automata
- Enumeration of finite automata
- IMPROVED BOUNDS ON THE NUMBER OF AUTOMATA ACCEPTING FINITE LANGUAGES
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item