Automata-theoretic and datalog-based solutions of monadic second-order logic evaluation problems over structures of bounded-treewidth
We propose automata-theoretic and datalog-based solutions for the Monadic Second Order (MSO) evaluation problem over finite structures of bounded treewidth, and then extend this approach to MSO-definable optimization problems. More precisely, we introduce decomposition-automata which can be thought...
| Main Authors: | Καλαντζή, Λαμπρινή, Φουστούκου, Ευγενία |
|---|---|
| Other Authors: | Kalantzi, Labrini |
| Format: | Technical Report |
| Language: | English |
| Published: |
2011
|
| Subjects: | |
| Online Access: | http://nemertes.lis.upatras.gr/jspui/handle/10889/4327 |
Similar Items
-
On model-theoretic approaches to monadic second-order logic evaluation
by: Κοσμαδάκης, Σταύρος, et al.
Published: (2014) -
Διαστασιολόγηση βιομηχανικού χώρου με διαφορετικές μεθόδους ανάλυσης
by: Βεντούρης, Αντώνιος
Published: (2020) -
Switching and finite automata theory
by: Kohavi, Zvi
Published: (1988) -
Ordered Sets
by: Harzheim, Egbert
Published: (2005) -
Theory of finite automata With an introduction to formal languages
by: Carroll, John, et al.
Published: (1989)