On the computation power of finite automata in two-dimensional environments
In: DLT 2004 : developements in language theory (Auckland, 13-17 December 2004)Lecture notes in computer science :261-271
Konferenz
- print, 19 ref
Zugriff:
In this paper we study the model of a finite state automaton interacting with infinite two-dimensional geometric environments. We show that the reachability problem for a finite state automaton interacting with a quadrant of the plane extended by a power function, a polynomial function or a linear function is algorithmically undecidable, by simulating a Minsky machine. We also consider the environment defined by a parabola which impedes the direct simulation of multiplication. However we show that the model of a finite automaton interacting inside a parabola is also universal.
Titel: |
On the computation power of finite automata in two-dimensional environments
|
---|---|
Autor/in / Beteiligte Person: | KURGANSKYY, Oleksiy ; POTAPOV, Igor |
Link: | |
Quelle: | DLT 2004 : developements in language theory (Auckland, 13-17 December 2004)Lecture notes in computer science :261-271 |
Veröffentlichung: | Berlin: Springer, 2004 |
Medientyp: | Konferenz |
Umfang: | print, 19 ref |
ISSN: | 0302-9743 (print) |
Schlagwort: |
|
Sonstiges: |
|