Undecidability results for finite interactive systems

Alexandru Sofronia, Alexandru Popa, Gheorghe Stefanescu

Research output: Chapter in Book/Report/Conference proceedingConference contribution

2 Citations (Scopus)

Abstract

This paper is on the foundations of a recent approach to the design of massively parallel and interactive programming 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 equivalence between FISs and tile systems, making explicit that they precisely capture recognizable two-dimensional languages.

Original languageEnglish
Title of host publicationProceedings of the 2008 10th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, SYNASC 2008
Pages366-369
Number of pages4
DOIs
Publication statusPublished - 2008
Event2008 10th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, SYNASC 2008 - Timisoara, Romania
Duration: Sep 26 2008Sep 29 2008

Publication series

NameProceedings of the 2008 10th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, SYNASC 2008

Conference

Conference2008 10th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, SYNASC 2008
CountryRomania
CityTimisoara
Period9/26/089/29/08

ASJC Scopus subject areas

  • Computational Theory and Mathematics
  • Software

Fingerprint Dive into the research topics of 'Undecidability results for finite interactive systems'. Together they form a unique fingerprint.

Cite this