Regular languages of star height one
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 2086619
- ON THE STAR HEIGHT OF RATIONAL LANGUAGES
- On theory of regular languages with the Kleene star operation
- The infinite 2-star height hierarchy of extended regular languages of star degree at most two
- Kleene star on unary regular languages
- scientific article; zbMATH DE number 2086220
- One-unambiguous regular languages
- One-unambiguous regular languages
- scientific article; zbMATH DE number 1534571
- scientific article; zbMATH DE number 1688391
Cited in
(24)- Algorithms for determining relative star height and star height
- Polynomial operations and hierarchies of concatenation
- Algorithms for determining relative inclusion star height and inclusion star height
- More languages of generalised star height 1
- The infinite 2-star height hierarchy of extended regular languages of star degree at most two
- New upper bounds to the limitedness of distance automata
- 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}\).
- Equational theories of tropical semirings
- Equivalence of regular binoid expressions and regular expressions denoting binoid languages over free binoids
- The limitedness problem on distance automata: Hashiguchi's method revisited
- Characterization and complexity results on jumping finite automata
- On the power of circular splicing
- scientific article; zbMATH DE number 2086220 (Why is no real title available?)
- On the star-height of subword counting languages and their relationship to Rees zero-matrix semigroups
- scientific article; zbMATH DE number 4213459 (Why is no real title available?)
- ON THE STAR HEIGHT OF RATIONAL LANGUAGES
- Open problems about regular languages, 35 years later
- scientific article; zbMATH DE number 2086619 (Why is no real title available?)
- scientific article; zbMATH DE number 826075 (Why is no real title available?)
- Characterizing regular languages with polynomial densities
- Foundations of Software Science and Computation Structures
- Distance desert automata and the star height problem
- Limitedness theorem on finite automata with distance functions: An algebraic proof
- Improved limitedness theorems on finite automata with distance functions
This page was built for publication: Regular languages of star height one
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3339308)
