Alternating automata, the weak monadic theory of the tree, and its complexity
- 1 January 1986
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 275-283
- https://doi.org/10.1007/3-540-16761-7_77
Abstract
No abstract availableKeywords
This publication has 1 reference indexed in Scilit:
- The theory of ends, pushdown automata, and second-order logicTheoretical Computer Science, 1985