Abstract:A register automaton is a finite automaton with finitely many registers
ranging from an infinite alphabet. Since the valuations of registers are
infinite, there are infinitely many configurations. We describe a technique to
classify infinite register automata configurations into finitely many exact
representative configurations. Using the finitary representation, we give an
algorithm solving the reachability problem for register automata. We moreover
define a computation tree logic for register automata and so… Show more
Set email alert for when this publication receives citations?
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.