4 search results - page 1 / 1 » An introduction to finite automata and their connection to l... |
CORR
2010
Springer
13 years 2 months ago
2010
Springer
DLT
2009
13 years 3 months ago
2009
While a mature theory around logics such as MSO, LTL, and CTL has been developed in the pure boolean setting of finite automata, weighted automata lack such a natural connection wi...
ENTCS
2002
13 years 5 months ago
2002
The paper discusses the hierarchy of indices of finite automata over infinite objects. This hierarchy corresponds exactly to the hierarchy of alternations of least and greatest fi...
LATA
2010
Springer
14 years 2 months ago
2010
Springer
Abstract. Iterated schemata allow to define infinite languages of propositional formulae through formulae patterns. Formally, schemata extend propositional logic with new (generali...