Complementing unary nondeterministic automata (Q1763723): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
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: Finite automata and unary languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5422234 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3856819 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4412108 / rank
 
Normal rank
Property / cites work
 
Property / cites work: NONDETERMINISTIC DESCRIPTIONAL COMPLEXITY OF REGULAR LANGUAGES / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4506483 / rank
 
Normal rank
Property / cites work
 
Property / cites work: THE STRUCTURE AND COMPLEXITY OF MINIMAL NFA’S OVER A UNARY ALPHABET / 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: Q4503152 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Simulations between Unary Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Bounds for State-Set Size in the Proofs of Equivalence Between Deterministic, Nondeterministic, and Two-Way Finite Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4941905 / rank
 
Normal rank
Property / cites work
 
Property / cites work: UNARY LANGUAGE OPERATIONS, STATE COMPLEXITY AND JACOBSTHAL'S FUNCTION / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5541339 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the maximal order in $S_n$ and $S*_n$ / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2731279 / rank
 
Normal rank

Latest revision as of 18:29, 7 June 2024

scientific article
Language Label Description Also known as
English
Complementing unary nondeterministic automata
scientific article

    Statements

    Complementing unary nondeterministic automata (English)
    0 references
    0 references
    0 references
    22 February 2005
    0 references
    0 references
    Formal languages
    0 references
    Finite state automata
    0 references
    Unary languages
    0 references
    Descriptional complexity
    0 references
    Complementation
    0 references
    0 references
    0 references