Globally deterministic CD-systems of stateless R(1)-automata

Authors:
Benedek Nagy;Friedrich Otto
Affiliations:
Department of Computer Science, Faculty of Informatics, University of Debrecen, Hungary;Fachbereich Elektrotechnik/Informatik, Universität Kassel, Kassel, Germany
Venue:
LATA'11 Proceedings of the 5th international conference on Language and automata theory and applications
Year:
2011

Citing 3
Cited 2

The Book of Traces

The Book of Traces
CD-systems of stateless deterministic r(1)-automata accept all rational trace languages

LATA'10 Proceedings of the 4th international conference on Language and Automata Theory and Applications
Strictly deterministic CD-systems of restarting automata

FCT'07 Proceedings of the 16th international conference on Fundamentals of Computation Theory

Characterizing the regular languages by nonforgetting restarting automata

DLT'11 Proceedings of the 15th international conference on Developments in language theory
On restarting automata with window size one

DCFS'11 Proceedings of the 13th international conference on Descriptional complexity of formal systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

Although the component automata of a cooperating distributed system (CD-system) of stateless deterministic R(1)-automata are all deterministic, the CD-system itself is not. Here we study CDsystems of stateless deterministic R(1)-automata that are themselves completely deterministic. These CD-systems correspond to deterministic finite-state acceptors with translucent letters. We investigate the expressive power of these systems, study the closure properties of the class of languages they accept, and show that the inclusion problem for these systems is undecidable, while their universe problem is decidable.