Sciweavers

815 search results - page 35 / 163
» Algebraic Recognizability of Languages
Sort
View
JLP
2008
121views more  JLP 2008»
14 years 10 months ago
A process algebraic view of shared dataspace coordination
Coordination languages were introduced in the early 80's as programming notations to manage the interaction among concurrent collaborating software entities. Process algebras...
Nadia Busi, Gianluigi Zavattaro
PARLE
1987
15 years 3 months ago
Decidability of Bisimulation Equivalence for Processes Generating Context-Free Languages
A context-freegrammar(CFG)in GreibachNormalForm coincides,in anothernotation,witha system of guarded recursion equations in Basic Process Algebra. Hence to each CFG a process can b...
Jos C. M. Baeten, Jan A. Bergstra, Jan Willem Klop
LACL
2005
Springer
15 years 5 months ago
A Polynomial Time Extension of Parallel Multiple Context-Free Grammar
Abstract. It is already known that parallel multiple context-free grammar (PMCFG) [1] is an instance of the equivalent formalisms simple literal movement grammar (sLMG) [2,3] and r...
Peter Ljunglöf
SERP
2003
15 years 1 months ago
Polymorphism in Object-Oriented Contract Verification
The role that design by contract plays in the specification, monitoring, and reuse of classes is of increasing importance in the OO community. Although recognizably useful, neverth...
Isabel Nunes
CAP
2010
14 years 6 months ago
A quantitative study of reductions in algebraic libraries
How much of existing computer algebra libraries is amenable to automatic parallelization? This is a difficult topic, yet of practical importance in the era of commodity multicore ...
Yue Li, Gabriel Dos Reis