Sciweavers

FOSSACS
2008
Springer
13 years 5 months ago
Optimal Lower Bounds on Regular Expression Size Using Communication Complexity
The problem of converting deterministic finite automata into (short) regular expressions is considered. It is known that the required expression size is 2(n) in the worst case for ...
Hermann Gruber, Jan Johannsen
APL
1995
ACM
13 years 7 months ago
Infix, Cut and Finite Automata
The behavior of one and two dimensional automata are displayed in two and three dimensions and via animations. Implementations of finite automata in J using "infix" and ...
Clifford A. Reiter
COCOON
2006
Springer
13 years 7 months ago
Varieties Generated by Certain Models of Reversible Finite Automata
Reversible finite automata with halting states (RFA) were first considered by Ambainis and Freivalds to facilitate the research of KondacsWatrous quantum finite automata. In this ...
Marats Golovkins, Jean-Eric Pin
CONEXT
2007
ACM
13 years 7 months ago
A hybrid finite automaton for practical deep packet inspection
Deterministic finite automata (DFAs) are widely used to perform regular expression matching in linear time. Several techniques have been proposed to compress DFAs in order to redu...
Michela Becchi, Patrick Crowley
ANCS
2007
ACM
13 years 7 months ago
Curing regular expressions matching algorithms from insomnia, amnesia, and acalculia
The importance of network security has grown tremendously and a collection of devices have been introduced, which can improve the security of a network. Network intrusion detectio...
Sailesh Kumar, Balakrishnan Chandrasekaran, Jonath...
ICALP
1998
Springer
13 years 7 months ago
Power of Cooperation and Multihead Finite Systems
Abstract. We consider systems of finite automata performing together computation on an input string. Each automaton has its own read head that moves independently of the other head...
Pavol Duris, Tomasz Jurdzinski, Miroslaw Kutylowsk...