47 search results - page 1 / 10 » Partially-Commutative Context-Free Processes |
CONCUR
2009
Springer
13 years 11 months ago
2009
Springer
Bisimulation equivalence is decidable in polynomial time for both sequential and commutative normed context-free processes, known as BPA and BPP, respectively. Despite apparent sim...
ESOP
2009
Springer
13 years 11 months ago
2009
Springer
We generalise a theory of multiparty session types for the π-calculus through asynchronous communication subtyping, which allows partial commutativity of actions with maximal fle...
ICGI
2010
Springer
13 years 2 months ago
2010
Springer
The Syntactic Concept Lattice is a residuated lattice based on the distributional structure of a language; the natural representation based on this is a context sensitive formalism...
EACL
2009
ACL Anthology
14 years 5 months ago
2009
ACL Anthology
PARLE
1987
13 years 8 months ago
1987
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...