10 search results - page 1 / 2 » Greibach Normal Form in Algebraically Complete Semirings |
CSL
2002
Springer
13 years 8 months ago
2002
Springer
LICS
1996
IEEE
14 years 21 days ago
1996
IEEE
In this note, we prove that having unique head-normal forms is a sufficient condition on partial combinatory algebras to be completable. As application,we show that the pca of str...
PARLE
1987
14 years 17 hour 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...
CONCUR
2009
Springer
14 years 3 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...
AMAST
1998
Springer
14 years 23 days ago
1998
Springer
The goal of this paper is to develop an algebraic theory of process scheduling. We specify a syntax for denoting processes composed of actions with given durations. Subsequently, w...