COMPLEXITY IN UNION-FREE REGULAR LANGUAGES (Q2909101): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Intersection and union of regular languages and state complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partial orders on words, minimal elements of regular languages, and state complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: On equations for union-free regular languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: State complexity of power / rank
 
Normal rank
Property / cites work
 
Property / cites work: A lower bound technique for the size of nondeterministic finite automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: State complexity of basic operations on suffix-free regular languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Descriptional and computational complexity of finite automata -- a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: STATE COMPLEXITY OF CONCATENATION AND COMPLEMENTATION / rank
 
Normal rank
Property / cites work
 
Property / cites work: State complexity of some operations on binary regular languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: State complexity of cyclic shift / rank
 
Normal rank
Property / cites work
 
Property / cites work: Succinct representation of regular languages by Boolean automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: The state complexity of \(L^{2}\) and \(L^k\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the state complexity of reversals of regular languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3392273 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The state complexities of some basic operations on regular languages / rank
 
Normal rank

Revision as of 15:25, 5 July 2024

scientific article
Language Label Description Also known as
English
COMPLEXITY IN UNION-FREE REGULAR LANGUAGES
scientific article

    Statements

    COMPLEXITY IN UNION-FREE REGULAR LANGUAGES (English)
    0 references
    0 references
    0 references
    29 August 2012
    0 references
    0 references
    union-free regular language
    0 references
    finite automaton
    0 references
    one-cycle-free-path automaton
    0 references
    descriptional complexity
    0 references
    closure properties
    0 references