2008 10th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (2008)

Timisoara, Romania

Sept. 26, 2008 to Sept. 29, 2008

ISBN: 978-0-7695-3523-4

pp: 366-369

ABSTRACT

This paper is on the foundations of a recent approach to the design of massively parallel and interactiveprogramming languages using rv-systems (interactive systems with registers and voices) and Agapia programming. It includes a few theoretical results on FISs (finite interactive systems), the underlying mechanism used for specifying control and interaction in these systems. First, we give a proof for the undecidability of the emptiness problem for FISs by reduction to the Post Correspondence Problem. Next, we use the proof to get other undecidability results, e.g., for the accessibility of a transition in a FIS, or for the finiteness of the language recognized by a FIS. Finally, we present a simple proof of the equivalencebetween FISs and tile systems, making explicit that they precisely capture recognizable two-dimensional languages.

INDEX TERMS

interactive computation, finite interactive systems, decidability, Agapia programming

CITATION

A. Popa, G. Stefanescu and A. Sofronia, "Undecidability Results for Finite Interactive Systems,"

*2008 10th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing(SYNASC)*, Timisoara, Romania, 2008, pp. 366-369.

doi:10.1109/SYNASC.2008.42

CITATIONS