Pages that link to "Item:Q3339308"

The following pages link to Regular languages of star height one (Q3339308):

Displaying 18 items.

• On the star-height of subword counting languages and their relationship to Rees zero-matrix semigroups (Q329726) (← links)
• Limitedness theorem on finite automata with distance functions: An algebraic proof (Q807031) (← links)
• Improved limitedness theorems on finite automata with distance functions (Q908702) (← links)
• Algorithms for determining relative star height and star height (Q1118420) (← links)
• Polynomial operations and hierarchies of concatenation (Q1183588) (← links)
• Algorithms for determining relative inclusion star height and inclusion star height (Q1183589) (← links)
• More languages of generalised star height 1 (Q1202929) (← links)
• The infinite 2-star height hierarchy of extended regular languages of star degree at most two (Q1341774) (← links)
• New upper bounds to the limitedness of distance automata (Q1575957) (← links)
• 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}\). (Q1853563) (← links)
• Equational theories of tropical semirings (Q1874279) (← links)
• Equivalence of regular binoid expressions and regular expressions denoting binoid languages over free binoids (Q1884948) (← links)
• The limitedness problem on distance automata: Hashiguchi's method revisited (Q1884970) (← links)
• Characterization and complexity results on jumping finite automata (Q2357104) (← links)
• On the power of circular splicing (Q2565850) (← links)
• (Q4858461) (← links)
• Foundations of Software Science and Computation Structures (Q5308455) (← links)
• Distance desert automata and the star height problem (Q5313718) (← links)