Technischer Report
On Globally Deterministic CD-Systems of Stateless R-Automata with Window Size One
Zusammenfassung
It is known that cooperating distributed systems (CD-systems) of stateless deterministic restarting automata with window size 1 accept a class of semi-linear languages that properly includes all rational trace languages. Although the component automata of such a CD-system are all deterministic, in general the CD-system itself is not, as in each of its computations, the initial component and the successor components are still chosen nondeterministically. Here we study CD-systems of stateless deterministic restarting automata with window size 1 that are themselves completely deterministic. In fact, we consider two such types of CD-systems, the strictly deterministic systems and the globally deterministic systems.
Zitieren
@techreport{urn:nbn:de:hebis:34-2011033037007,
author={Nagy, Benedek and Otto, Friedrich},
title={On Globally Deterministic CD-Systems of Stateless R-Automata with Window Size One},
year={2011}
}
0500 Oax 0501 Text $btxt$2rdacontent 0502 Computermedien $bc$2rdacarrier 1100 2011$n2011 1500 1/eng 2050 ##0##urn:nbn:de:hebis:34-2011033037007 3000 Nagy, Benedek 3010 Otto, Friedrich 4000 On Globally Deterministic CD-Systems of Stateless R-Automata with Window Size One / Nagy, Benedek 4030 4060 Online-Ressource 4085 ##0##=u http://nbn-resolving.de/urn:nbn:de:hebis:34-2011033037007=x R 4204 \$dTechnischer Report 4170 Kasseler Informatikschriften ;; 2011, 1 7136 ##0##urn:nbn:de:hebis:34-2011033037007
2011-03-30T12:27:19Z 2011-03-30T12:27:19Z 2011-03-30T12:27:19Z urn:nbn:de:hebis:34-2011033037007 http://hdl.handle.net/123456789/2011033037007 eng Urheberrechtlich geschützt https://rightsstatements.org/page/InC/1.0/ Restarting automaton Stateless automaton Cooperating distributed system Language hierarchies 004 On Globally Deterministic CD-Systems of Stateless R-Automata with Window Size One Technischer Report It is known that cooperating distributed systems (CD-systems) of stateless deterministic restarting automata with window size 1 accept a class of semi-linear languages that properly includes all rational trace languages. Although the component automata of such a CD-system are all deterministic, in general the CD-system itself is not, as in each of its computations, the initial component and the successor components are still chosen nondeterministically. Here we study CD-systems of stateless deterministic restarting automata with window size 1 that are themselves completely deterministic. In fact, we consider two such types of CD-systems, the strictly deterministic systems and the globally deterministic systems. open access Nagy, Benedek Otto, Friedrich Kasseler Informatikschriften ;; 2011, 1 Eine Kurzfassung dieser Arbeit ist zur Tagung LATA 2011 eingereicht und akzeptiert worden. Sie wird im entsprechenden Tagungsband erscheinen: AUTHOR = Nagy, B., Otto, F. TITLE = Globally deterministic CD-systems of stateless R(1)-automata EDITOR = Dediu, A.H., Inenaga, S., Martin-Vide, C. BOOKTITLE = LATA 2011, Proc. SERIES = Lecture Notes in Computer Science PUBLISHER = Springer ADDRESS = Berlin YEAR = 2011 F.1.1 F.4.3 Kasseler Informatikschriften 2011, 1
Die folgenden Lizenzbestimmungen sind mit dieser Ressource verbunden:
:Urheberrechtlich geschützt