Skip to main content
Conference Proceedings

On logics, tilings, and automata

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (1991) 510 LNCS 441-454
DOI: 10.1007/3-540-54233-7_154
59Citations
Citations of this article
10Readers
Mendeley users who have this article in their library.
Get full text

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.

Cite

CITATION STYLE

APA

Thomas, W. (1991). On logics, tilings, and automata. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 510 LNCS, pp. 441–454). Springer Verlag. https://doi.org/10.1007/3-540-54233-7_154

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free