Deterministic blow-ups of minimal NFA's (Q3421910): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / OpenAlex ID
 
Property / OpenAlex ID: W2158569204 / rank
 
Normal rank
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: Q4139689 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finite automata and unary languages / 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: NONDETERMINISTIC DESCRIPTIONAL COMPLEXITY OF REGULAR LANGUAGES / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4337605 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4465337 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Communication complexity method for measuring nondeterminism in finite automata / 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: A family of NFAs which need 2\(^{n}-\alpha\) deterministic states / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4453205 / 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: Q5541339 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds on the size of sweeping automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3392273 / rank
 
Normal rank

Latest revision as of 13:51, 25 June 2024

scientific article
Language Label Description Also known as
English
Deterministic blow-ups of minimal NFA's
scientific article

    Statements

    Deterministic blow-ups of minimal NFA's (English)
    0 references
    0 references
    0 references
    8 February 2007
    0 references
    0 references
    regular languages
    0 references
    deterministic finite automata
    0 references
    nondeterministic finite automata
    0 references
    state complexity
    0 references
    0 references