On Deciding Topological Classes of Deterministic Tree Languages (original) (raw)

E ective Topological Hierarchies of Recognizable Tree Languages

Filip Murlak

View PDFchevron_right

On the topological complexity of tree languages

Filip Murlak

2008

View PDFchevron_right

The Wadge Hierarchy of Deterministic Tree Languages

Filip Murlak

Logical Methods in Computer Science, 2008

View PDFchevron_right

On the Topological Complexity of Weakly Recognizable Tree Languages

Filip Murlak

Lecture Notes in Computer Science, 2007

View PDFchevron_right

Relating hierarchies of word and tree automata

Damian Niwinski

1998

View PDFchevron_right

On the complexity of the syntax of tree languages

Antonios Kalampakas

Lecture Notes in Computer Science, 2009

View PDFchevron_right

Effective Topological Hierarchies of

Filip Murlak

2008

View PDFchevron_right

Qualitative Tree Languages

Olivier Serre

2011 IEEE 26th Annual Symposium on Logic in Computer Science, 2011

View PDFchevron_right

Tree Automata and Automata on Linear Orderings

Géraud Sénizergues

Theoretical Informatics and Applications, 2009

View PDFchevron_right

On the separation question for tree languages

Damian Niwinski

2012

View PDFchevron_right

Tree algebras and varieties of tree languages

Mahdi Mahmoudsalehi

Theoretical Computer Science, 2007

View PDFchevron_right

1.1 Finite Tree Automata........................ 18 1.2 The Pumping Lemma for Recognizable Tree Languages..... 26

Florent Jacquemard

2008

View PDFchevron_right

Tree Automata, Mu-Calculus and Determinacy (Extended Abstract)

Charanjit Jutla

IEEE Symposium on Foundations of Computer Science, 1991

View PDFchevron_right

Ambiguity Hierarchy of Regular Infinite Tree Languages

Doron Tiferet

2020

View PDFchevron_right

On the formal points of the formal topology of the binary tree

Silvio Valentini

Archive for Mathematical Logic, 2002

View PDFchevron_right

Probabilistic tree automata and context free languages

Gadi Moran

Israel Journal of Mathematics, 1970

View PDFchevron_right

Tree automata, mu-calculus and determinacy

Charanjit Jutla

[1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science

View PDFchevron_right

Relating word and tree automata

Moshe Vardi

1996

View PDFchevron_right

Logic and tree automata

Iván Szabolcs

View PDFchevron_right

Deterministic top-down tree automata: past, present, and future

Wim Martens

2008

View PDFchevron_right

A Contraction Method to Decide MSO Theories of Deterministic Trees

Angelo Montanari

22nd Annual IEEE Symposium on Logic in Computer Science (LICS 2007), 2007

View PDFchevron_right

Weak Muller acceptance conditions for tree automata

Aniello Murano

Theoretical Computer Science, 2005

View PDFchevron_right

Systolic tree -languages: the operational and the logical view

Angelo Monti

Theoretical Computer Science, 2000

View PDFchevron_right

The Complexity of Tree Automata and Logics of Programs

Charanjit Jutla

SIAM Journal on Computing, 1999

View PDFchevron_right

Acceptance conditions for omega-languages and the Borel hierarchy

Enrico Formenti

View PDFchevron_right

Tree automata techniques and applications

Sophie Tison

1997

View PDFchevron_right

Regular languages of nested words: Fixed points, automata, and synchronization

Marcelo Arenas

2007

View PDFchevron_right

Linear Game Automata: Decidable Hierarchy Problems for Stripped-Down Alternating Tree Automata

Filip Murlak

Lecture Notes in Computer Science, 2009

View PDFchevron_right

Deterministic Automata and the Monadic Theory of Ordinals < ?2

Charles Zaiontz

Mlq, 1983

View PDFchevron_right

A kleene-like characterization of languages accepted by systolic tree automata

Emanuela Fachini

Journal of Computer and System Sciences, 1994

View PDFchevron_right

An automata-theoretical characterization of the OI-hierarchy

Werner Damm

Information and control, 1986

View PDFchevron_right

Reasoning About Co–Büchi Tree Automata

Aniello Murano

Lecture Notes in Computer Science, 2005

View PDFchevron_right

Languages accepted by systolic Y-tree automata: structural characterizations

Domenico Parente, Emanuela Fachini

Acta Informatica, 1992

View PDFchevron_right

ω-rational Languages: High Complexity Classes vs. Borel Hierarchy

Enrico Formenti

Lecture Notes in Computer Science, 2014

View PDFchevron_right

Regular Tree and Regular Hedge Languages over Unranked Alphabets: Version 1

Anne Brüggemann-klein

2001

View PDFchevron_right