Enumerating regular expressions and their languages
type: Item
instance of: scholarly article
title: Enumerating regular expressions and their languages
author: Yanyan Li
publication date: 2022-02-04T00:00:00Z
full work available at URL: https://arxiv.org/abs/1204.4982
review text: Summary: For the entire collection see [Zbl 1470.68001].
Mathematics Subject Classification ID: 68Q45
zbMATH DE Number: 7469511
describes a project that uses: Grail
MaRDI profile type: MaRDI publication profile
cites work: Q4091421
cites work: Enumeration and generation with a string automata representation
cites work: Q3077339
cites work: Asymptotic enumeration of minimal automata
cites work: Enumeration and random generation of accessible automata
cites work: A determinant of Stirling cycle numbers counts unlabeled acyclic single-source automata
cites work: Q5526125
cites work: Q3413659
cites work: Q3024007
cites work: IMPROVED BOUNDS ON THE NUMBER OF AUTOMATA ACCEPTING FINITE LANGUAGES
cites work: Q3396587
cites work: Q4465333
cites work: Complexity measures for regular expressions
cites work: Q5437181
cites work: Q3549563
cites work: Q3285871
cites work: Q3669422
cites work: Simplifying Regular Expressions
cites work: The number of functional digraphs
cites work: Q3272972
cites work: Enumeration of finite automata
cites work: A Census of Finite Automata
cites work: Q4143433
cites work: Q3862379
cites work: Follow automata.
cites work: Q4349924
cites work: Q5557941
cites work: Q4089775
cites work: Q3704880
cites work: Q5396738
cites work: Implementation and Application of Automata
cites work: Q3900998
cites work: Exact enumeration of acyclic deterministic automata
cites work: Q5536277
cites work: Q4941905
cites work: On the Average Size of Glushkov’s Automata
cites work: Q3370010
cites work: Automaticity. II: Descriptional complexity in the unary case
cites work: Enumeration of strongly connected sequential machines
cites work: \textit{Grail}: A C++ library for automata and expressions
cites work: A note on the number of functional digraphs
cites work: Q3690227
cites work: Q3754202
cites work: Automaticity. I: Properties of a measure of descriptional complexity
cites work: Q4236280
cites work: Q3376041
cites work: Regular expression for a language without empty word
DOI: 10.4171/AUTOMATA-1/13
description: scientific article; zbMATH DE number 7469511