Unary finite automata vs. arithmetic progressions
Author:
- 1 August 2009
- journal article
- research article
- Published by Elsevier in Information Processing Letters
- Vol. 109 (17) , 1010-1014
Abstract
No abstract availableKeywords
All Related Versions
This publication has 5 references indexed in Scilit:
- Finite Automata, Palindromes, Powers, and PatternsLecture Notes in Computer Science, 2008
- The Frobenius Problem and Its Generalizations2008
- A Special Case of a Unary Regular Language ContainmentTheory of Computing Systems, 2005
- Finite automata and unary languagesTheoretical Computer Science, 1986
- On a Problem of PartitionsAmerican Journal of Mathematics, 1942