555 search results - page 15 / 111 » Complexity of Operations on Cofinite Languages |
WSC
1996
13 years 8 months ago
1996
Eight successively refined simulation models for the earthmoving operations involved in the construction of a dam provide the foundation for illustrating the ease and effectivenes...
CICLING
2003
Springer
14 years 22 days ago
2003
Springer
In setting up a formal system to specify a grammar formalism, the conventional (mathematical) wisdom is to start with primitives (basic primitive structures) as simple as possible...
ICDT
2009
ACM
14 years 8 months ago
2009
ACM
The ability to flexibly compose confidence computation with the operations of relational algebra is an important feature of probabilistic database query languages. Computing confi...
ENTCS
2006
13 years 7 months ago
2006
We introduce variant types and a pattern matching operation to synchronous dataflow languages. These languages are used in the design of reactive systems. As these systems grow in...
ACL
1994
13 years 8 months ago
1994
Finite-state transducers give efficient representations of many Natural Language phenomena. They allow to account for complex lexicon restrictions encountered, without involving t...