UNARY LANGUAGE OPERATIONS, STATE COMPLEXITY AND JACOBSTHAL'S FUNCTION (Q3021944): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q61677531, #quickstatements; #temporary_batch_1711574657256
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: On a question of regarding visibility of lattice points / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a Problem of Partitions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finite automata and unary languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Über eine zahlentheoretische Funktion von Jacobsthal / 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: The state complexities of some basic operations on regular languages / rank
 
Normal rank

Revision as of 11:45, 10 June 2024

scientific article
Language Label Description Also known as
English
UNARY LANGUAGE OPERATIONS, STATE COMPLEXITY AND JACOBSTHAL'S FUNCTION
scientific article

    Statements

    UNARY LANGUAGE OPERATIONS, STATE COMPLEXITY AND JACOBSTHAL'S FUNCTION (English)
    0 references
    0 references
    0 references
    22 June 2005
    0 references
    finite automata
    0 references
    formal languages
    0 references
    state complexity
    0 references
    number theory
    0 references
    unary languages
    0 references

    Identifiers