Unary finite automata vs. arithmetic progressions (Q989556): Difference between revisions
From MaRDI portal
Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
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 |
Revision as of 02: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
20 August 2010
0 references
formal languages
0 references
unary languages
0 references
arithmetic progressions
0 references
algorithms
0 references