Emptiness and Finiteness for Tree Automata with Global Reflexive Disequality Constraints
- 8 November 2012
- journal article
- research article
- Published by Springer Nature in Journal of Automated Reasoning
- Vol. 51 (4) , 371-400
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Efficient reasoning about data trees via integer linear programming2011
- Rigid tree automata and applicationsInformation and Computation, 2011
- TREE AUTOMATA WITH GLOBAL CONSTRAINTSInternational Journal of Foundations of Computer Science, 2010
- The Emptiness Problem for Tree Automata with Global Constraints2010
- Two-variable logic on data trees and XML reasoningJournal of the ACM, 2009
- Ground reducibility is EXPTIME-complete2002
- Term Rewriting and All That1998
- Automata for Reduction Properties SolvingJournal of Symbolic Computation, 1995
- Ground reducibility and automata with disequality constraintsLecture Notes in Computer Science, 1994
- Equality and disequality constraints on direct subterms in tree automata1992