2632 search results - page 70 / 527 » Alternating Timed Automata |
JUCS
2002
15 years 1 months ago
2002
: In this paper, we present a fast and simple algorithm for constructing a minimal acyclic deterministic finite automaton from a finite set of words. Such automata are useful in a ...
NAACL
2003
2003
Syntax-based Alignment of Multiple Translations: Extracting Paraphrases and Generating New Sentences
15 years 2 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...
136
click to vote
FM
1999
Springer
15 years 5 months ago
1999
Springer
Abstract. The design of controllers for hybridsystems i.e. mixeddiscretecontinuous systems in a systematic manner remains a challenging task. In this case study, we apply formal m...
119
click to vote
ECCC
2000
15 years 1 months ago
2000
Deterministic k-tape and multitape Turing machines with one-way, two-way and without a separated input tape are considered. We investigate the classes of languages acceptable by s...
101
click to vote
CERA
2010
15 years 1 months ago
2010
Multilevel design problems are typically decomposed into a hierarchy of distributed and strongly coupled sub-problems, each solved by design teams with specialized knowledge and t...