Kleene closure and state complexity (Q2956884): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: IN SEARCH OF MOST COMPLEX REGULAR LANGUAGES / rank
 
Normal rank
Property / cites work
 
Property / cites work: On equations for regular languages, finite automata, and sequential networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: State complexity of union and intersection of star on \(k\) regular languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Magic numbers in the state hierarchy of finite automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3655366 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight bounds on the number of states of DFAs that are equivalent to \(n\)-state NFAs / rank
 
Normal rank
Property / cites work
 
Property / cites work: THE RANGES OF STATE COMPLEXITIES FOR COMPLEMENT, STAR, AND REVERSAL OF REGULAR LANGUAGES / rank
 
Normal rank
Property / cites work
 
Property / cites work: MAGIC NUMBERS AND TERNARY ALPHABET / rank
 
Normal rank
Property / cites work
 
Property / cites work: Kleene Closure on Regular and Prefix-Free Languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5628039 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3392273 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5541339 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The state complexities of some basic operations on regular languages / rank
 
Normal rank

Latest revision as of 07:25, 13 July 2024

scientific article
Language Label Description Also known as
English
Kleene closure and state complexity
scientific article

    Statements

    Identifiers