Tree acceptors and some of their applications (original) (raw)
Related papers
Tree Automata and Automata on Linear Orderings
Theoretical Informatics and Applications, 2009
A First-Order Axiomatization of the Theory of Finite Trees
Journal of Logic, Language and Information, 1995
Expressiveness of Monadic Second-Order Logics on Infinite Trees of Arbitrary Branching Degree
2012
Weak Muller acceptance conditions for tree automata
Theoretical Computer Science, 2005
Decidability of MSO Theories of Tree Structures
Lecture Notes in Computer Science, 2004
Tree Automata, Mu-Calculus and Determinacy (Extended Abstract)
IEEE Symposium on Foundations of Computer Science, 1991
2008
On the finite degree of ambiguity of finite tree automata
Acta Informatica, 1989
Tree algebras and varieties of tree languages
Theoretical Computer Science, 2007
Weighted tree automata and weighted logics
Theoretical Computer Science, 2006
Ambiguity Hierarchy of Regular Infinite Tree Languages
2020
2020
2011 IEEE 26th Annual Symposium on Logic in Computer Science, 2011
Monadic Second Order Logic and Automata on Infinite Words : Büchi ’ s Theorem
2007
VARIETIES OF REGULAR ALGEBRAS AND UNRANKED TREE LANGUAGES
Tree automata, mu-calculus and determinacy
[1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science
Weighted Logics for Unranked Tree Automata
Theory of Computing Systems, 2011
A Finite Semantics of Simply-Typed Lambda Terms for Infinite Runs of Automata
Logical Methods in Computer Science, 2007
The Emptiness Problem for Tree Automata with Global Constraints
2010 25th Annual IEEE Symposium on Logic in Computer Science, 2010
A Contraction Method to Decide MSO Theories of Deterministic Trees
22nd Annual IEEE Symposium on Logic in Computer Science (LICS 2007), 2007
Regular tree languages and quasi orders
Acta Cybernetica, 2006
Reasoning About Co–Büchi Tree Automata
Lecture Notes in Computer Science, 2005
Expressing Cardinality Quantifiers in Monadic Second-Order Logic over Trees
Łukasz Kaiser, Vince Bárány, Alexander Rabinovich
Fundamenta Informaticae, volume 100, pages 1-18, 2010
2013
On the separation question for tree languages
2012
Lecture Notes on Monadic First- and Second-Order Logic on Strings
arXiv (Cornell University), 2023
On Proofs and Types in Second Order Logic
2015
Higher-Order Pushdown Trees Are Easy
Lecture Notes in Computer Science, 2002
Theories of arithmetics in finite models
The Journal of Symbolic Logic, 2005
A characterization of lambda definable tree operations
Information and Computation/information and Control, 1990
On arithmetical first-order theories allowing encoding and decoding of lists
Theoretical Computer Science, 1999
Logic Meets Algebra: the Case of Regular Languages
Logical Methods in Computer Science, 2007
A Characterisation of Lambda Definable Tree Operations
Information and Computation/information and Control, 1990
Demonstratio Mathematica
Two-way cost automata and cost logics over infinite trees
Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 2014