Self-regulating finite automata

Meduna Alexander and Masopust Tomáš: Self-regulating finite automata. In: Acta cybernetica, (18) 1. pp. 135-153. (2007)

Preview

Cikk, tanulmány, mű Meduna_2007_ActaCybernetica.pdf Download (232kB) | Preview

Abstract

This paper introduces and discusses self-regulating finite automata. In essence, these automata regulate the use of their rules by a sequence of rules applied during previous moves. A special attention is paid to turns defined as moves during which a self-regulating finite automaton starts a new self-regulating sequence of moves. Based on the number of turns, the present paper establishes two infinite hierarchies of language families resulting from two variants of these automata. In addition, it demonstrates that these hierarchies coincide with the hierarchies resulting from parallel right linear grammars and right linear simple matrix grammars, so the self-regulating finite automata can be viewed as the automaton counterparts to these grammars. Finally, this paper compares both infinite hierarchies. In addition, as an open problem area, it suggests the discussion of self-regulating pushdown automata and points out that they give rise to no infinite hierarchy analogical to the achieved hierarchies resulting from the self-regulating finite automata.

Item Type:	Article
Heading title:	Regular papers
Journal or Publication Title:	Acta cybernetica
Date:	2007
Volume:	18
Number:	1
ISSN:	0324-721X
Page Range:	pp. 135-153
Language:	English
Place of Publication:	Szeged
Related URLs:	http://acta.bibl.u-szeged.hu/38523/
Uncontrolled Keywords:	Számítástechnika, Kibernetika, Automaták
Additional Information:	Bibliogr.: p. 152-153. ; összefoglalás angol nyelven
Subjects:	01. Natural sciences 01. Natural sciences > 01.02. Computer and information sciences
Date Deposited:	2016. Oct. 15. 12:25
Last Modified:	2022. Jun. 16. 13:56
URI:	http://acta.bibl.u-szeged.hu/id/eprint/12807

Actions (login required)

View Item