206 search results - page 37 / 42 » Regular Expressions into Finite Automata |
101
click to vote
CORR
2011
Springer
14 years 4 months ago
2011
Springer
Finite trace semantics is known and well understood for classical automata and non-deterministic labelled transition systems. Jacobs et al introduced a more general definition fo...
76
Voted
POPL
2010
ACM
15 years 7 months ago
2010
ACM
Traditional parser generation technologies are incapable of handling the demands of modern programmers. In this paper, we present the design and theory of a new parsing engine, YA...
PLILP
1997
Springer
15 years 1 months ago
1997
Springer
We introduce a framework for managing as a whole the space of a narrowing computation. The aim of our framework is to find a finite representation of an infinite narrowing space...
FSTTCS
2010
Springer
14 years 7 months ago
2010
Springer
The parity acceptance condition for -regular languages is a special case of the Rabin and Streett acceptance conditions. While the parity acceptance condition is as expressive as ...
FOSSACS
2006
Springer
15 years 1 months ago
2006
Springer
We define a new decidable logic for expressing and checking invariants of programs that manipulate dynamically-allocated objects via pointers and destructive pointer updates. The ...