Multi-tape and infinite-state automata—a survey

Authors:
Patrick C. Fischer
Affiliations:
Harvard Univ., Cambridge, MA
Venue:
Communications of the ACM
Year:
1965

Citing 9
Cited 5

A Variant to Turing's Theory of Computing Machines

Journal of the ACM (JACM)
Categorizing Automata by W-Machine Programs

Journal of the ACM (JACM)
Computability of Recursive Functions

Journal of the ACM (JACM)
RS -Machines with Almost Blank Tape

Journal of the ACM (JACM)
Random-Access Stored-Program Machines, an Approach to Programming Languages

Journal of the ACM (JACM)
Generation of Primes by a One-Dimensional Real-Time Iterative Array

Journal of the ACM (JACM)
On Formalisms for Turing Machines

Journal of the ACM (JACM)
Introduction to Mathematical Machine Theory

Introduction to Mathematical Machine Theory
Sequential Machines: Selected Papers

Sequential Machines: Selected Papers

An Overview of the Theory of Computational Complexity

Journal of the ACM (JACM)
Curriculum 68: Recommendations for academic programs in computer science: a report of the ACM curriculum committee on computer science

Communications of the ACM
Multitiered nonlinear morphology using multitape finite automata: a case study on Syriac and Arabic

Computational Linguistics - Special issue on finite-state methods in NLP
The concept of nondeterminism: its development and implications for teaching

ACM SIGCSE Bulletin
On pure multi-pushdown automata that perform complete pushdown pops

Acta Cybernetica

Quantified Score

Hi-index	48.23

Visualization

Abstract