2409 search results - page 10 / 482 » On Extended Regular Expressions |
86
Voted
IMSCCS
2006
IEEE
15 years 3 months ago
2006
IEEE
The equivalence of non-deterministic finite automata (NFA1 ), deterministic finite automata (DFA), regular expressions (RE), and parallel finite automata (PFA) with augmented r...
103
click to vote
RTA
2000
Springer
15 years 1 months ago
2000
Springer
Parallelism constraints are logical descriptions of trees. Parallelism constraints subsume dominance constraints and are equal in expressive power to context unification. Paralleli...
77
Voted
WCRE
2003
IEEE
15 years 2 months ago
2003
IEEE
In reverse engineering, parsing may be partially done to extract lightweight source models. Parsing code containing preprocessing directives, syntactical errors and embedded langu...
80
Voted
CAV
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. Dynamic Pushdown Networks (DPNs) are a model for parallel programs with (recursive) procedures and process creation. The goal of this paper is to develop generic techniqu...
DIAGRAMS
2008
Springer
14 years 11 months ago
2008
Springer
Abstract. The spider diagram logic forms a fragment of constraint diagram logic and is designed to be primarily used as a diagrammatic software specification tool. Our interest is ...