Finite automata with multiplication
- 30 September 1976
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 2 (3) , 271-294
- https://doi.org/10.1016/0304-3975(76)90081-5
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Note on analogue memory automataInformation Sciences, 1974
- Bounded-reversal multihead finite automata languagesInformation and Control, 1974
- A note on semilinear sets and bounded-reversal multihead pushdown automataInformation Processing Letters, 1974
- On the closure of AFL under reversalInformation and Control, 1970
- Parallel program schemataJournal of Computer and System Sciences, 1969
- Multi-tape and multi-head pushdown automataInformation and Control, 1968
- One-way stack automataJournal of the ACM, 1967
- Deterministic context free languagesInformation and Control, 1966
- Recursive Unsolvability of Post's Problem of "Tag" and other Topics in Theory of Turing MachinesAnnals of Mathematics, 1961
- Finite Automata and Their Decision ProblemsIBM Journal of Research and Development, 1959