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

Full description

Bibliographic Details

Published in:	Electronic notes in theoretical computer science Vol. 239; pp. 131 - 141
Main Authors:	Abdulla, Parosh Aziz, Krcal, Pavel, Yi, Wang
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 01.07.2009
Subjects:	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 Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!