Deciding Monadic Theories of Hyperalgebraic Trees
Authors:
- 25 April 2001
- book chapter
- Published by Springer Nature
- p. 253-267
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Type fixpoints1999
- Infinite λ-calculus and typesTheoretical Computer Science, 1999
- Model Checking and Higher-Order RecursionLecture Notes in Computer Science, 1999
- Fixed point characterization of infinite behavior of finite-state systemsTheoretical Computer Science, 1997
- Infinitary lambda calculusTheoretical Computer Science, 1997
- Languages, Automata, and Logic1997
- On infinite transition graphs having a decidable monadic theory1996
- The monadic second-order logic of graphs IX: Machines and their behavioursTheoretical Computer Science, 1995
- The IO- and OI-hierarchiesTheoretical Computer Science, 1982
- Decidability of Second-Order Theories and Automata on Infinite TreesTransactions of the American Mathematical Society, 1969