A regular characterization of graph languages definable in monadic second-order logic
- 30 September 1991
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 88 (1) , 139-150
- https://doi.org/10.1016/0304-3975(91)90078-g
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- The monadic second-order logic of graphs. I. Recognizable sets of finite graphsInformation and Computation, 1990
- Characterization of ω-regular languages by first-order formulasTheoretical Computer Science, 1983
- Tree acceptors and some of their applicationsJournal of Computer and System Sciences, 1970
- Generalized finite automata theory with an application to a decision problem of second-order logicTheory of Computing Systems, 1968
- Decision problems of finite automata design and related arithmeticsTransactions of the American Mathematical Society, 1961
- Weak Second‐Order Arithmetic and Finite AutomataMathematical Logic Quarterly, 1960