Sciweavers

Share
SPIN
2010
Springer
9 years 2 months ago
An Automata-Based Symbolic Approach for Verifying Programs on Relaxed Memory Models
This paper addresses the problem of verifying programs for the relaxed memory models implemented in modern processors. Specifically, it considers the TSO (Total Store Order) relax...
Alexander Linden, Pierre Wolper
RAID
2010
Springer
9 years 2 months ago
Improving NFA-Based Signature Matching Using Ordered Binary Decision Diagrams
Network intrusion detection systems (NIDS) make extensive use of regular expressions as attack signatures. Internally, NIDS represent and operate these signatures using finite au...
Liu Yang, Rezwana Karim, Vinod Ganapathy, Randy Sm...
JUCS
2010
119views more  JUCS 2010»
9 years 2 months ago
On Succinct Representations of Textured Surfaces by Weighted Finite Automata
: Generalized finite automata with weights for states and transitions have been successfully applied to image generation for more than a decade now. Bilevel images (black and whit...
Jürgen Albert, German Tischler
JALC
2007
109views more  JALC 2007»
9 years 3 months ago
A Family of NFAs Free of State Reductions
Merging states in finite automata is a main method of reducing the size of the representation of regular languages. The process has been extensively studied for deterministic fi...
Cezar Câmpeanu, Nicolae Santean, Sheng Yu
JALC
2007
79views more  JALC 2007»
9 years 3 months ago
Two-Way Finite Automata with a Write-Once Track
The basic finite automata model has been extended over the years with different acceptance modes (nondeterminism, alternation), new or improved devices (two-way heads, pebbles, ...
Berke Durak
IPL
2007
94views more  IPL 2007»
9 years 3 months ago
A note on emptiness for alternating finite automata with a one-letter alphabet
We present a new proof of PSPACE-hardness of the emptiness problem for alternating finite automata with a singleton alphabet. This result was shown by Holzer (1995) who used a pr...
Petr Jancar, Zdenek Sawa
IJFCS
2007
105views more  IJFCS 2007»
9 years 3 months ago
On the Existence of Lookahead Delegators for NFA
We investigate deterministically simulating (i.e., solving the membership problem for) nondeterministic finite automata (NFA), relying solely on the NFA’s resources (states and...
Bala Ravikumar, Nicolae Santean
FSTTCS
2008
Springer
9 years 4 months ago
An Optimal Construction of Finite Automata from Regular Expressions
We consider the construction of finite automata from their corresponding regular expressions by a series of digraph-transformations along the expression’s structure. Each interm...
Stefan Gulan, Henning Fernau
DLT
2007
9 years 5 months ago
Inapproximability of Nondeterministic State and Transition Complexity Assuming P=!NP
Abstract. Inapproximability results concerning minimization of nondeterministic finite automata relative to given deterministic finite automata were obtained only recently, modul...
Hermann Gruber, Markus Holzer
HYBRID
1995
Springer
9 years 7 months ago
Interconnected Automata and Linear Systems: A Theoretical Framework in Discrete-Time
This paper summarizes the definitions and several of the main results of an approach to hybrid systems, which combines finite automata and linear systems, developed by the author...
Eduardo D. Sontag
books