On a Certain Generalization of Finite Automata, Which Forms a Hierarchy Analogous to the Grzegorczyk Classification of Primitively Recursive Functions

V. A. Kozmidiadi

A chapter in Systems Theory Research, 1973, pp 129-177 from Springer

Abstract: Abstract This paper considers a certain generalization of the notion of a finite automaton. A sequence of expanding classes of n-automata (n = 0, 1, 2, ...) is formed. Each of the classes is formed by closure via a composition in the class of primitive n-automata. Under these conditions a primitive n-automaton operates similarly to a conventional finite automaton: it has an initial state and is stipulated by a certain function of transitions that determine the new state as a function of the previous state and the next input level. However, the states of the automaton are words in the input alphabet; the output word is formed as a sequence of states that are passed through by the automaton due to the action of the input word. The function of transitions for a primitive automaton of the (n + l)-st rank is stipulated by means of an automaton of the n-th rank.

Date: 1973
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-1-4757-0079-4_7

Ordering information: This item can be ordered from
http://www.springer.com/9781475700794

DOI: 10.1007/978-1-4757-0079-4_7

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().