Pairs of complementary unary languages with ``balanced'' nondeterministic automata (Q2429361): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Some results on the structure of unary unambiguous automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finite automata and unary 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: The Largest Prime Dividing the Maximal Order of an Element of S n / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the power of Las Vegas for one-way communication complexity, OBDDs, and finite automata / 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: Converting Self-verifying Automata into Deterministic Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complementing unary nondeterministic automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Simulations between Unary Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Maximum Order of an Element of a Finite Symmetric Group / 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: Sur l'ordre maximum d'un élément dans le groupe $S_n$ des permutations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unambiguous Finite Automata over a Unary Alphabet / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5541339 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relating the Type of Ambiguity of Finite Automata to the Succinctness of Their Representation / 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: Unary finite automata vs. arithmetic progressions / rank
 
Normal rank

Revision as of 02:39, 5 July 2024

scientific article
Language Label Description Also known as
English
Pairs of complementary unary languages with ``balanced'' nondeterministic automata
scientific article

    Statements

    Pairs of complementary unary languages with ``balanced'' nondeterministic automata (English)
    0 references
    0 references
    0 references
    0 references
    26 April 2012
    0 references
    finite state automata
    0 references
    state complexity
    0 references
    unary regular languages
    0 references
    unary automata
    0 references

    Identifiers