Restarting Automata The Standard Type of Restarting Automaton and Its Variants /

In this unique volume, the expressive capacity of the various types of restarting automata is studied, and the resulting classes of languages are compared to each other and to the classes of an extended Chomsky hierarchy. A restarting automaton consists of a finite-state control, a flexible tape wit...

Full description

Bibliographic Details

Main Author:	Otto, Friedrich (Author)
Corporate Author:	SpringerLink (Online service)
Format:	Electronic eBook
Language:	English
Published:	Cham : Springer Nature Switzerland : Imprint: Springer, 2025.
Edition:	1st ed. 2025.
Series:	Theory and Applications of Computability, In cooperation with the Association Computability in Europe,
Subjects:	Computer science. Machine theory. Computational linguistics. Theory of Computation. Formal Languages and Automata Theory. Computational Linguistics.
Online Access:	https://doi.org/10.1007/978-3-031-70094-1
Tags:	Add Tag No Tags, Be the first to tag this record!