Name
Abstract | ||
|---|---|---|
We investigate the defining power of finite recursive specifications over the theory with + (alternative composition) and · (sequential composition) and λ (the state operator) over a finite set of states, and find that it is greater than that of the same theory without state operator. Thus, adding the state operator is an essential extension of BPA (the theory of processes over +, ·). On the other hand, applying the state operator to a regular process again gives a regular process. As a limiting result in the other direction, we find that not all PA-processes (where also parallel composition λ is present) can be defined over BPA plus state operator. |
Year | DOI | Venue |
|---|---|---|
1991 | 10.1016/0304-3975(91)90225-Q | Theor. Comput. Sci. |
Keywords | Field | DocType |
recursive process definition,state operator | Discrete mathematics,Finite-rank operator,Quasinormal operator,Shift operator,Strictly singular operator,Semi-elliptic operator,Multiplication operator,Compact operator,Ladder operator,Mathematics | Journal |
Volume | Issue | ISSN |
82 | 2 | Theoretical Computer Science |
Citations | PageRank | References |
4 | 0.54 | 4 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| j c m baeten | 1 | 394 | 37.92 |
| Jan A. Bergstra | 2 | 1445 | 140.42 |