Universality of R-automata with Value Copying

R-automata are finite state machines extended with counters which can be incremented or reset to zero along the transitions. The universality question asks whether there is a constant D such that all words are accepted by some run along which no counter exceeds D. It has been shown in [Parosh Abdull...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Electronic notes in theoretical computer science Jg. 239; S. 131 - 141
Hauptverfasser:	Abdulla, Parosh Aziz, Krcal, Pavel, Yi, Wang
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Elsevier B.V 01.07.2009
Schlagworte:	Computer science Datavetenskap decidability Distance automata with resets and copying Information technology Informationsteknik TECHNOLOGY TEKNIKVETENSKAP universality universality Distance automata with resets and copying decidability
ISSN:	1571-0661, 1571-0661
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!