Sciweavers

110 search results - page 12 / 22
» Mean-Payoff Automaton Expressions
Sort
View
RSA
2008
87views more  RSA 2008»
13 years 8 months ago
A combinatorial approach to jumping particles: The parallel TASEP
In this paper we continue the combinatorial study of models of particles jumping on a row of cells which we initiated with the standard totally asymmetric exclusion process or TASE...
Enrica Duchi, Gilles Schaeffer
CORR
2009
Springer
99views Education» more  CORR 2009»
13 years 6 months ago
Quotient Complexity of Regular Languages
The past research on the state complexity of operations on regular languages is examined, and a new approach based on an old method (derivatives of regular expressions) is presente...
Janusz A. Brzozowski
CONCUR
2008
Springer
13 years 10 months ago
A Notion of Glue Expressiveness for Component-Based Systems
Abstract. Comparison between different formalisms and models is often by flattening structure and reducing them to behaviorally equivalent models e.g., automaton and Turing machine...
Simon Bliudze, Joseph Sifakis
SIGCOMM
2006
ACM
14 years 2 months ago
Algorithms to accelerate multiple regular expressions matching for deep packet inspection
There is a growing demand for network devices capable of examining the content of data packets in order to improve network security and provide application-specific services. Most...
Sailesh Kumar, Sarang Dharmapurikar, Fang Yu, Patr...
ANCS
2007
ACM
14 years 18 days 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...