We investigate a model of self-assembling finite automata. An automaton is assembled on demand during its computation from copies out of a finite set of items. These items are pieces of a finite automaton which are connected to the already assembled automaton by identifying states. Depending on the allowed number of such interface states, the degree, infinite hierarchies of properly included language families are shown. The presented model is a natural and unified generalization of regular and context-free languages since degrees one and two are characterizing the finite and pushdown automata, respectively. Moreover, by means of different closure properties nondeterministic and deterministic language families are separated.
[1]
John N. Shutt,et al.
Self-Modifying Finite Automata: An Introduction
,
1995,
Inf. Process. Lett..
[2]
John N. Shutt.
Self-Modifying Finite Automata - Power and Limitations
,
1995
.
[3]
John N. Shutt,et al.
Self-Modifying Finite Automata
,
1994,
IFIP Congress.
[4]
L. Penrose,et al.
Self-Reproducing Machines
,
1959
.
[5]
Kazuhiro Saitou,et al.
On Classes of One-dimensional Self-assembling Automata
,
1996,
Complex Syst..
[6]
Markus E. Nebel.
On the Power of Subroutines for Finite State Machines
,
2001,
J. Autom. Lang. Comb..
[7]
Katsushi Inoue,et al.
A Note on Self-Modifying Finite Automata
,
1999,
Inf. Process. Lett..