73 search results - page 4 / 15 » Products of Tree Automata with an Application to Temporal Lo... |
DLT
2008
13 years 9 months ago
2008
A tree automaton with global tree equality and disequality constraints, TAGED for short, is an automaton on trees which allows to test (dis)equalities between subtrees which may be...
LICS
2005
IEEE
14 years 1 months ago
2005
IEEE
We consider unranked trees, that have become an active subject of study recently due to XML applications, and characterize commonly used fragments of firstorder (FO) and monadic ...
TCS
2002
13 years 7 months ago
2002
An operation M which constructs from a given structure M a tree-like structure whose domain consists of the finite sequences of elements of M is considered. A notion of automata r...
FUIN
2010
13 years 5 months ago
2010
Bounded Model Checking (BMC) is an efficient technique applicable to verification of temporal properties of (timed) distributed systems. In this paper we show for the first time ho...
IANDC
2008
13 years 7 months ago
2008
In the area of Description Logic (DL), both tableau-based and automata-based algorithms are frequently used to show decidability and complexity results for basic inference problem...