Sciweavers

759 search results - page 70 / 152
» Overlap-Free Regular Languages
Sort
View
FOSSACS
2010
Springer
15 years 1 months ago
Degrees of Lookahead in Regular Infinite Games
We study variants of regular infinite games where the strict alternation of moves between the two players is subject to modifications. The second player may postpone a move for a f...
Michael Holtmann, Lukasz Kaiser, Wolfgang Thomas
AAAI
2007
15 years 5 days ago
Answering Regular Path Queries in Expressive Description Logics: An Automata-Theoretic Approach
Expressive Description Logics (DLs) have been advocated as formalisms for modeling the domain of interest in various application areas. An important requirement is the ability to ...
Diego Calvanese, Thomas Eiter, Magdalena Ortiz
FPL
2008
Springer
178views Hardware» more  FPL 2008»
14 years 11 months ago
High-speed regular expression matching engine using multi-character NFA
An approach is presented for high throughput matching of regular expressions (regexes) by first converting them into corresponding Non-deterministic Finite Automata (NFAs) which a...
Norio Yamagaki, Reetinder P. S. Sidhu, Satoshi Kam...
DLT
2003
14 years 11 months ago
NFA Reduction Algorithms by Means of Regular Inequalities
We present different techniques for reducing the number of states and transitions in nondeterministic automata. These techniques are based on the two preorders over the set of st...
Jean-Marc Champarnaud, Fabien Coulon
CONSTRAINTS
2006
115views more  CONSTRAINTS 2006»
14 years 10 months ago
A Cost-Regular Based Hybrid Column Generation Approach
Abstract. Constraint Programming (CP) offers a rich modeling language of constraints embedding efficient algorithms to handle complex and heterogeneous combinatorial problems. To s...
Sophie Demassey, Gilles Pesant, Louis-Martin Rouss...