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...

Celý popis

Podrobná bibliografia

Vydané v:	Electronic notes in theoretical computer science Ročník 239; s. 131 - 141
Hlavní autori:	Abdulla, Parosh Aziz, Krcal, Pavel, Yi, Wang
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Elsevier B.V 01.07.2009
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!