scientific article; zbMATH DE number 3790415
From MaRDI portal
Publication:3967525
Cited in
(7)- Variétés d'automates descendants d'arbres infinis
- Topological characterizations of infinite tree languages
- Generalized automata on infinite trees and Muller-McNaughton's theorem
- A gap property of deterministic tree languages.
- Theμ-calculus alternation-depth hierarchy is strict on binary trees
- Automata on infinite objects and their applications to logic and programming
- Hierarchies of weak automata and weak monadic formulas
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3967525)