In this paper we study the problem of minimising deterministic automata over finite and infinite words. Deterministic finite automata are the simplest devices to recognise regular...
Abstract--We argue for the creation and use of a very lightweight requirements modeling language as an alternative to textual and pictorial requirements specifications.