213 search results - page 16 / 43 » Relating Word and Tree Automata |
TACAS
2010
Springer
14 years 2 months ago
2010
Springer
Abstract. We present a general theory that exploits simulation relations on transition systems to obtain antichain algorithms for solving the reachability and repeated reachability...
FCT
1991
Springer
13 years 11 months ago
1991
Springer
Maximal word functions occur in data retrieval applications and have connections with ranking problems, which in turn were rst investigated in relation to data compression 21 . By ...
JUCS
2002
13 years 7 months ago
2002
: The problem about the synchronization of a finite deterministic automaton is not yet properly understood. The present paper investigates this and related problems within the gene...
LICS
2007
IEEE
14 years 1 months ago
2007
IEEE
Higher-order matching is the problem given t = u where t, u are terms of simply typed λ-calculus and u is closed, is there a substitution θ such that tθ and u have the same nor...
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...