๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Resetting words for decidable automata

โœ Scribed by I. K. Rystov

Book ID
105545995
Publisher
Springer US
Year
1994
Tongue
English
Weight
371 KB
Volume
30
Category
Article
ISSN
1573-8337

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Reset words for commutative and solvable
Reset words for commutative and solvable automata
โœ Igor Rystsov ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 451 KB

A reset word takes all states of a finite automaton to a single state. In this paper, it is shown that the length of the shortest reset word for a solvable automaton with n states is at most n -1 and this bound is reachable.

Decidable and Undecidable Problems about
Decidable and Undecidable Problems about Quantum Automata
โœ Blondel, Vincent D.; Jeandel, Emmanuel; Koiran, Pascal; Portier, Natacha ๐Ÿ“‚ Article ๐Ÿ“… 2005 ๐Ÿ› Society for Industrial and Applied Mathematics ๐ŸŒ English โš– 159 KB
Generalized discrete timed automata: dec
Generalized discrete timed automata: decidable approximations for safety verification
โœ Zhe Dang; Oscar H. Ibarra; Richard A. Kemmerer ๐Ÿ“‚ Article ๐Ÿ“… 2003 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 175 KB

We consider generalized discrete timed automata with general linear relations over clocks and parameterized constants as clock constraints and with parameterized durations. We look at three approximation techniques (i.e., the r-reset-bounded approximation, the B-bounded approximation, and the B; r -