Finite automata and unary languages
- 1 January 1986
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 47, 149-158
- https://doi.org/10.1016/0304-3975(86)90142-8
Abstract
No abstract availableKeywords
This publication has 16 references indexed in Scilit:
- AlternationJournal of the ACM, 1981
- Simple counter machines and number-theoretic problemsJournal of Computer and System Sciences, 1979
- The LBA-problem and the deterministic tape complexity of two-way one-counter languages over a one-letter alphabetActa Informatica, 1977
- On tape bounds for single letter alphabet language processingTheoretical Computer Science, 1976
- Space bounds for processing contentless inputsJournal of Computer and System Sciences, 1975
- Some independent families of one-letter languagesJournal of Computer and System Sciences, 1975
- On a linear diophantine problem of FrobeniusActa Arithmetica, 1972
- A Two-Way Automaton with Fewer States than Any Equivalent One-Way AutomatonIEEE Transactions on Computers, 1971
- A LINEAR DIOPHANTINE EQUATION WITH APPLICATIONS TO NON-NEGATIVE MATRICESAnnals of the New York Academy of Sciences, 1970
- On a Problem of PartitionsAmerican Journal of Mathematics, 1942