495 search results - page 26 / 99 » Automata and differentiable words |
154
click to vote
JUCS
2002
15 years 5 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 ...
145
click to vote
STACS
2010
Springer
16 years 27 days ago
2010
Springer
A cellular automaton (CA) is a parallel synchronous computing model, which consists in a juxtaposition of finite automata (cells) whose state evolves according to that of their ne...
123
click to vote
ACL
2010
15 years 4 months ago
2010
A central problem in historical linguistics is the identification of historically related cognate words. We present a generative phylogenetic model for automatically inducing cogn...
169
click to vote
IANDC
2008
15 years 6 months ago
2008
Hybrid systems are dynamical systems with the ability to describe mixed discretecontinuous evolution of a wide range of systems. Consequently, at first glance, hybrid systems appe...
224
click to vote
CAV
2011
Springer
14 years 9 months ago
2011
Springer
Abstract. The underground malware-based economy is flourishing and it is evident that the classical ad-hoc signature detection methods are becoming insufficient. Malware authors ...