7 search results - page 1 / 2 » Some Minimality Results on Biresidual and Biseparable Automa... |
LATA
2010
Springer
13 years 10 months ago
2010
Springer
CORR
2009
Springer
13 years 3 months ago
2009
Springer
The minimal deterministic finite automaton is generally used to determine regular languages equality. Using Brzozowski's notion of derivative, Antimirov and Mosses proposed a...
WIA
2001
Springer
13 years 9 months ago
2001
Springer
Abstract. We present a reflection on the evolution of the different methods for constructing minimal deterministic acyclic finite-state automata from a finite set of words. We ...
CORR
2007
Springer
13 years 5 months ago
2007
Springer
The study of finite automata and regular languages is a privileged meeting point of algebra and logic. Since the work of Büchi, regular languages have been classified according ...
STACS
1997
Springer
13 years 9 months ago
1997
Springer
Exotic semirings such as the “(max, +) semiring” (R ∪ {−∞}, max, +), or the “tropical semiring” (N ∪ {+∞}, min, +), have been invented and reinvented many times s...