109 search results - page 3 / 22 » On minimising automata with errors |
ADL
1997
Springer
13 years 8 months ago
1997
Springer
Successful applications of digital libraries require structured access to sources of information. This paper presents an approach to extract the logical structure of text document...
CORR
2009
Springer
13 years 2 months ago
2009
Springer
The minimal deterministic finite automaton is generally used to determine regular languages equality. Using Brzozowski's notion of derivative, Antimirov and Mosses proposed a...
CCS
2007
ACM
13 years 10 months ago
2007
ACM
Human Desoxyribo-Nucleic Acid (DNA) sequences offer a wealth of information that reveal, among others, predisposition to various diseases and paternity relations. The breadth and...
ICGI
2000
Springer
13 years 8 months ago
2000
Springer
ENTCS
2007
13 years 4 months ago
2007
Bounded Model Checking (BMC) is a successful refutation method to detect errors in not only circuits and other binary systems but also in systems with more complex domains like ti...