426 search results - page 53 / 86 » Synchronization of Regular Automata |
ANCS
2007
ACM
13 years 11 months ago
2007
ACM
Modern network intrusion detection systems need to perform regular expression matching at line rate in order to detect the occurrence of critical patterns in packet payloads. Whil...
RTA
2000
Springer
13 years 11 months ago
2000
Springer
Parallelism constraints are logical descriptions of trees. Parallelism constraints subsume dominance constraints and are equal in expressive power to context unification. Paralleli...
MLG
2007
Springer
14 years 1 months ago
2007
Springer
We give a universal kernel that renders all the regular languages linearly separable. We are not able to compute this kernel efficiently and conjecture that it is intractable, but...
LATA
2010
Springer
14 years 5 months ago
2010
Springer
Abstract. Iterated schemata allow to define infinite languages of propositional formulae through formulae patterns. Formally, schemata extend propositional logic with new (generali...
ALIFE
1999
13 years 7 months ago
1999
tion, structural dissolutionAbstract We constructed a simple evolutionary system, "evoloop," on a deterministic nine-state five-neighbor cellular automata (CA) space by i...