Algorithms for determining the smallest number of nonterminals (states) sufficient for generating (accepting) a regular language R with R₁ R R₂ for given regular languages R₁,R₂.
From MaRDI portal
Publication:1853563
Recommendations
- scientific article; zbMATH DE number 176770
- scientific article; zbMATH DE number 3592984
- scientific article; zbMATH DE number 4116004
- Nondeterministic state complexity for suffix-free regular languages
- scientific article; zbMATH DE number 2068873
- Determination of finite automata accepting subregular languages
- Finite transducers and nondeterministic state complexity of regular languages
- scientific article; zbMATH DE number 1773088
- An optimal lower bound for nonregular languages
- Nondeterministic State Complexity of Basic Operations for Prefix-Free Regular Languages
Cites work
Cited in
(2)
This page was built for publication: Algorithms for determining the smallest number of nonterminals (states) sufficient for generating (accepting) a regular language \(R \) with \(R_{1}\subseteq R\subseteq R_{2}\) for given regular languages \(R_{1},R_{2}\).
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1853563)