759 search results - page 90 / 152 » Odometers on Regular Languages |
198
click to vote
ACIIDS
2011
IEEE
14 years 5 months ago
2011
IEEE
While in the traditional workflow processes the control flow is determined statically within process definitions, in declarative workflow processes the control flow is dynamic and ...
PPOPP
2012
ACM
13 years 5 months ago
2012
ACM
In program debugging, reproducibility of bugs is a key requirement. Unfortunately, bugs in concurrent programs are notoriously difficult to reproduce because bugs due to concurre...
109
click to vote
ACL
2012
13 years 8 days ago
2012
We argue that multilingual parallel data provides a valuable source of indirect supervision for induction of shallow semantic representations. Specifically, we consider unsupervi...
103
click to vote
CORR
2011
Springer
14 years 4 months ago
2011
Springer
In the algebraic theory of codes and formal languages, the set Q of all primitive words over some alphabet Σ has received special interest. With this survey article we give an ove...
ACMSE
2006
ACM
15 years 3 months ago
2006
ACM
Classic results in the theory of regular languages show that the problem of converting an NFA (nondeterministic finite automaton) into a minimal equivalent NFA is NP-hard, even f...