141 search results - page 14 / 29 » An Algorithm for Transformation of Finite Automata to Regula... |
ARTS
1997
Springer
14 years 23 days ago
1997
Springer
In 10 , an algebra for timed automata has been introduced. In this article, we introduce a syntactic characterisation of nite timed automata in terms of that process algebra. We s...
IJCSA
2007
13 years 8 months ago
2007
A large number of problems that occur in knowledge-representation, learning, VLSI-design, and other areas of artificial intelligence, are essentially satisfiability problems. The ...
CCS
2007
ACM
14 years 2 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...
BIRTHDAY
2004
Springer
14 years 2 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...
NAACL
2003
2003
Syntax-based Alignment of Multiple Translations: Extracting Paraphrases and Generating New Sentences
13 years 10 months ago
We describe a syntax-based algorithm that automatically builds Finite State Automata (word lattices) from semantically equivalent translation sets. These FSAs are good representat...