11 search results - page 2 / 3 » A Trie-Based Approach for Compacting Automata |
ICALP
2010
Springer
13 years 10 months ago
2010
Springer
We propose a new approach to the notion of recognition, which departs from the classical definitions by three specific features. First, it does not rely on automata. Secondly, it...
ICGI
2010
Springer
13 years 4 months ago
2010
Springer
Abstract. We present an exact algorithm for identification of deterministic finite automata (DFA) which is based on satisfiability (SAT) solvers. Despite the size of the low level ...
ICCAD
1999
IEEE
13 years 10 months ago
1999
IEEE
Available techniques for testing core-based systems-on-a-chip (SOCs) do not provide a systematic means for synthesising low-overhead test architectures and compact test solutions....
ICLP
2005
Springer
13 years 11 months ago
2005
Springer
Any finite tree automaton (or regular type) can be used to construct act interpretation of a logic program, by first determinising and completing the automaton to get a pre-inter...
WSC
1997
13 years 7 months ago
1997
A simulation environment of the coordinated operation of multiple Autonomous Underwater Vehicles (AUVs) is presented. The primary application of this simulation environment is the...