W. Thomas. Automata, Languages and Programming, volume 510 of Lecture Notes in Computer Science, Springer Berlin Heidelberg, (1991)
DOI: 10.1007/3-540-54233-7_154
Abstract
We relate the logical and the automata theoretic approach to define sets of words, trees, and graphs. For this purpose a notion of “graph acceptor” is introduced which can specify monadic second-order properties and allows to treat known types of finite automata in a common framework. In the final part of the paper, we discuss infinite graphs that have a decidable monadic second-order theory.
%0 Book Section
%1 thomas1991logics
%A Thomas, Wolfgang
%B Automata, Languages and Programming
%D 1991
%E Albert, JavierLeach
%E Monien, Burkhard
%E Artalejo, MarioRodríguez
%I Springer Berlin Heidelberg
%K 2013 automata logics tilings
%P 441-454
%R 10.1007/3-540-54233-7_154
%T On logics, tilings, and automata
%U http://dx.doi.org/10.1007/3-540-54233-7_154
%V 510
%X We relate the logical and the automata theoretic approach to define sets of words, trees, and graphs. For this purpose a notion of “graph acceptor” is introduced which can specify monadic second-order properties and allows to treat known types of finite automata in a common framework. In the final part of the paper, we discuss infinite graphs that have a decidable monadic second-order theory.
%@ 978-3-540-54233-9
@incollection{thomas1991logics,
abstract = {We relate the logical and the automata theoretic approach to define sets of words, trees, and graphs. For this purpose a notion of “graph acceptor” is introduced which can specify monadic second-order properties and allows to treat known types of finite automata in a common framework. In the final part of the paper, we discuss infinite graphs that have a decidable monadic second-order theory.},
added-at = {2014-02-04T15:43:06.000+0100},
author = {Thomas, Wolfgang},
biburl = {https://www.bibsonomy.org/bibtex/2060c5ae70ff2c13c6176e20ebec3ef57/s_6wg2xw},
booktitle = {Automata, Languages and Programming},
description = {On logics, tilings, and automata - Springer},
doi = {10.1007/3-540-54233-7_154},
editor = {Albert, JavierLeach and Monien, Burkhard and Artalejo, MarioRodríguez},
interhash = {109e4b64b1a59fa5a5f6c1c14a7d3c6a},
intrahash = {060c5ae70ff2c13c6176e20ebec3ef57},
isbn = {978-3-540-54233-9},
keywords = {2013 automata logics tilings},
pages = {441-454},
publisher = {Springer Berlin Heidelberg},
series = {Lecture Notes in Computer Science},
timestamp = {2014-02-04T15:43:06.000+0100},
title = {On logics, tilings, and automata},
url = {http://dx.doi.org/10.1007/3-540-54233-7_154},
volume = 510,
year = 1991
}