Unary finite automata vs. arithmetic progressions (Q989556): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2004542062 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 0812.1291 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4773298 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finite Automata, Palindromes, Powers, and Patterns / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a Problem of Partitions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4344149 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A special case of a unary regular language containment / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5586371 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Frobenius Problem and Its Generalizations / rank
 
Normal rank

Latest revision as of 03:21, 3 July 2024

scientific article
Language Label Description Also known as
English
Unary finite automata vs. arithmetic progressions
scientific article

    Statements

    Unary finite automata vs. arithmetic progressions (English)
    0 references
    0 references
    20 August 2010
    0 references
    0 references
    formal languages
    0 references
    unary languages
    0 references
    arithmetic progressions
    0 references
    algorithms
    0 references
    0 references
    0 references