Theoretical Computer Science
Exact complexity bounds for ordinal addition
Theoretical Computer Science
On Infinite Terms Having a Decidable Monadic Theory
MFCS '02 Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science
Trees, Ordinals and Termination
TAPSOFT '93 Proceedings of the International Joint Conference CAAP/FASE on Theory and Practice of Software Development
An Automata-Theoretic Approach to Reasoning about Infinite-State Systems
CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
Automata logics, and infinite games: a guide to current research
Automata logics, and infinite games: a guide to current research
Nondeterministic tree automata
Automata logics, and infinite games
Automata logics, and infinite games
The complexity of translating logic to finite automata
Automata logics, and infinite games
On the Automata Size for Presburger Arithmetic
LICS '04 Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science
Higher order pushdown automata, the Caucal hierarchy of graphs and parity games
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
| Hi-index | 0.00 |
We give a new simple proof of the decidability of the First Order Theory of $({\omega}^{{\omega}^i},+)$ and the Monadic Second Order Theory of (ωi,