Sciweavers

6 search results - page 2 / 2
» Deeper Connections Between LTL and Alternating Automata
Sort
View
CORR
2007
Springer
79views Education» more  CORR 2007»
13 years 5 months ago
Logic Meets Algebra: the Case of Regular Languages
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 ...
Pascal Tesson, Denis Thérien