Hierarchies of weak automata and weak monadic formulas
- 28 June 1991
- journal article
- research article
- Published by Elsevier in Theoretical Computer Science
- Vol. 83 (2) , 323-335
- https://doi.org/10.1016/0304-3975(91)90283-8
Abstract
No abstract availableKeywords
This publication has 3 references indexed in Scilit:
- Alternating automata on infinite treesTheoretical Computer Science, 1987
- On fixed-point clonesPublished by Springer Nature ,1986
- Generalized finite automata theory with an application to a decision problem of second-order logicTheory of Computing Systems, 1968