Regular languages of star height one
From MaRDI portal
Publication:3339308
DOI10.1016/S0019-9958(82)91028-2zbMath0547.68072OpenAlexW2034955938WikidataQ56061217 ScholiaQ56061217MaRDI QIDQ3339308
No author found.
Publication date: 1982
Published in: Information and Control (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0019-9958(82)91028-2
Related Items
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, Distance desert automata and the star height problem, Algorithms for determining relative star height and star height, Improved limitedness theorems on finite automata with distance functions, Polynomial operations and hierarchies of concatenation, Algorithms for determining relative inclusion star height and inclusion star height, New upper bounds to the limitedness of distance automata, On the power of circular splicing, 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}\)., Limitedness theorem on finite automata with distance functions: An algebraic proof, Characterization and complexity results on jumping finite automata
