FOSSACS
2008
Springer
14 years 3 months ago
2008
Springer
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 ...
APL
1995
ACM
14 years 5 months ago
1995
ACM
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 ...
COCOON
2006
Springer
14 years 6 months ago
2006
Springer
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 ...
CONEXT
2007
ACM
14 years 6 months ago
2007
ACM
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...
ANCS
2007
ACM
14 years 6 months ago
2007
ACM
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...
ICALP
1998
Springer
14 years 6 months ago
1998
Springer
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...