Expressiveness of Min-Max Automata

A min-max automaton is a finite state automaton with a finite number of registers storing non-negative integer values that are updated by expressions consisting of register names and operations min, max and +1. We discuss the expressiveness results concerning these automata. This is a joint work with Thomas Colcombet and Stefan Göller.

Authors

• Amaldev Manuel

Keywords

No keywords are indexed for this paper.