On Infinite Terms Having a Decidable Monadic Theory
MFCS '02 Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science
On Families of Graphs Having a Decidable First Order Theory with Reachability
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Ground Tree Rewriting Graphs of Bounded Tree Width
STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
Axiomatising Tree-Interpretable Structures
STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
On the Transition Graphs of Turing Machines
MCU '01 Proceedings of the Third International Conference on Machines, Computations, and Universality
On the transition graphs of Turing machines
Theoretical Computer Science
Automata logics, and infinite games
The modular decomposition of countable graphs: constructions in monadic second-order logic
CSL'05 Proceedings of the 19th international conference on Computer Science Logic
Hi-index | 0.00 |