206 search results - page 7 / 42 » Deterministic Caterpillar Expressions |
ENTCS
2006
14 years 11 months ago
2006
A process is extensionally deterministic if, after any trace s and given any event a, it is either certain to accept or certain to refuse a (stably) after s. We show how several p...
SIGECOM
2009
ACM
15 years 6 months ago
2009
ACM
Voting trees describe an iterative procedure for selecting a single vertex from a tournament. vide a very general abstract model of decision-making among a group of individuals, a...
185
click to vote
SIGMOD
2009
ACM
15 years 12 months ago
2009
ACM
Whether beloved or despised, XML Schema is momentarily the only industrially accepted schema language for XML and is unlikely to become obsolete any time soon. Nevertheless, many ...
105
click to vote
ENTCS
2002
14 years 11 months ago
2002
Non-deterministic computations greatly enhance the expressive power of functional logic programs, but are often computationally expensive. We analyze a programming technique that ...
IMSCCS
2006
IEEE
15 years 5 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...