206 search results - page 12 / 42 » Regular Expressions into Finite Automata |
MEMOCODE
2010
IEEE
13 years 6 months ago
2010
IEEE
Abstract--This paper shows an implementation of CANSCID (Combined Architecture for Stream Categorization and Intrusion Detection). To satisfy the required system throughput, the pa...
ASE
2010
13 years 8 months ago
2010
Recent developments in runtime verification and monitoring show that parametric regular and temporal logic specifications can be efficiently monitored against large programs. Howev...
LATIN
2010
Springer
13 years 10 months ago
2010
Springer
We study the worst case complexity of regular operations on cofinite languages (i.e., languages whose complement is finite) and provide algorithms to compute efficiently the result...
HYBRID
2009
Springer
14 years 3 months ago
2009
Springer
We show that regarding finite automata (FA) as discrete, time-invariant linear systems over semimodules, allows to: (1) express FA minimization and FA determinization as particula...
ASPDAC
2007
ACM
14 years 13 days ago
2007
ACM
In this paper, we present a method for generating checker circuits from sequential-extended regular expressions (SEREs). Such sequences form the core of increasingly-used Assertion...