815 search results - page 47 / 163 » Algebraic Recognizability of Languages |
177
click to vote
EWDW
1990
15 years 10 months ago
1990
The formal description of the semantics of object-oriented data models is still an open problem. Some characteristic features of object-oriented data models, such as methods and i...
202
click to vote
ESOP
1992
Springer
15 years 10 months ago
1992
Springer
We have designed, implemented, and proved the correctness of a compiler generator that accepts action semantic descriptions of imperative programming languages. The generated comp...
179
click to vote
ICALP
2007
Springer
16 years 6 days ago
2007
Springer
We present algebraic conditions on constraint languages Γ that ensure the hardness of the constraint satisfaction problem CSP(Γ) for complexity classes L, NL, P, NP and ModpL. Th...
198
click to vote
FOCS
1990
IEEE
15 years 10 months ago
1990
IEEE
A new algebraic technique for the construction of interactive proof systems is presented. Our technique is used to prove that every language in the polynomial-time hierarchy has an...
154
click to vote
ACSD
2008
IEEE
15 years 8 months ago
2008
IEEE
We present a process algebra with conditionally distributed discrete-time delays and generally-distributed stochastic delays. The treatment allows for expansion laws for the paral...