47 search results - page 1 / 10 » Partially-Commutative Context-Free Processes |
115
Voted
CONCUR
2009
Springer
15 years 7 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...
97
Voted
ESOP
2009
Springer
15 years 7 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...
122
Voted
ICGI
2010
Springer
14 years 10 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
16 years 1 months ago
2009
ACL Anthology
117
Voted
PARLE
1987
15 years 4 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...