64 search results - page 2 / 13 » Reducing the Size of NFAs by Using Equivalences and Preorder... |
BIRTHDAY
2004
Springer
13 years 10 months ago
2004
Springer
We give faster algorithms for two methods of reducing the number of states in nondeterministic finite automata. The first uses equivalences and the second uses preorders. We deve...
JLP
2006
13 years 4 months ago
2006
We present a formal framework for notions related to testing and model based test generation for a behavioural subset of UML Statecharts (UMLSCs). This framework builds, on one ha...
ICCAD
2005
IEEE
14 years 1 months ago
2005
IEEE
— This paper addresses the problem of equivalence verification of RTL descriptions. The focus is on datapathoriented designs that implement polynomial computations over fixed-s...
LANMR
2007
13 years 6 months ago
2007
Abstract We study the notion of strong equivalence between two disjunctive logic programs under the G3-stable model semantics, also called the P-stable semantics, and we show how s...
SAS
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. Pointer information is a prerequisite for most program analyses, and inclusion-based, i.e. Andersen-style, pointer analysis is widely used to compute such information. Ho...