Recursive process definitions with the state operator:
Abstract: "We investigate the defining power of finite recursive specifications over the theory with + (alternative composition and . (sequential composition and [lambda] (the state operator) over a finite set of states, and find that it is greater than that of the same theory without state ope...
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Amsterdam
1989
|
| Schriftenreihe: | Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS
89,20 |
| Schlagworte: | |
| Zusammenfassung: | Abstract: "We investigate the defining power of finite recursive specifications over the theory with + (alternative composition and . (sequential composition and [lambda] (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." |
| Beschreibung: | 15 S. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV009257903 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 940313s1989 |||| 00||| eng d | ||
| 035 | |a (OCoLC)22883476 | ||
| 035 | |a (DE-599)BVBBV009257903 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-29T | ||
| 100 | 1 | |a Baeten, Josephus C. M. |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Recursive process definitions with the state operator |c J. C. M. Baeten, J. A. Bergstra |
| 264 | 1 | |a Amsterdam |c 1989 | |
| 300 | |a 15 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS |v 89,20 | |
| 520 | 3 | |a Abstract: "We investigate the defining power of finite recursive specifications over the theory with + (alternative composition and . (sequential composition and [lambda] (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." | |
| 650 | 4 | |a Computer programming | |
| 650 | 4 | |a Recursive functions | |
| 700 | 1 | |a Bergstra, Jan A. |d 1951- |e Verfasser |0 (DE-588)123304881 |4 aut | |
| 810 | 2 | |a Department of Computer Science: Report CS |t Centrum voor Wiskunde en Informatica <Amsterdam> |v 89,20 |w (DE-604)BV008928356 |9 89,20 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-006160013 | ||
Datensatz im Suchindex
| _version_ | 1804123704933744640 |
|---|---|
| any_adam_object | |
| author | Baeten, Josephus C. M. Bergstra, Jan A. 1951- |
| author_GND | (DE-588)123304881 |
| author_facet | Baeten, Josephus C. M. Bergstra, Jan A. 1951- |
| author_role | aut aut |
| author_sort | Baeten, Josephus C. M. |
| author_variant | j c m b jcm jcmb j a b ja jab |
| building | Verbundindex |
| bvnumber | BV009257903 |
| ctrlnum | (OCoLC)22883476 (DE-599)BVBBV009257903 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01766nam a2200313 cb4500</leader><controlfield tag="001">BV009257903</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">940313s1989 |||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)22883476</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV009257903</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakddb</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-29T</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Baeten, Josephus C. M.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Recursive process definitions with the state operator</subfield><subfield code="c">J. C. M. Baeten, J. A. Bergstra</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Amsterdam</subfield><subfield code="c">1989</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">15 S.</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="1" ind2=" "><subfield code="a">Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS</subfield><subfield code="v">89,20</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "We investigate the defining power of finite recursive specifications over the theory with + (alternative composition and . (sequential composition and [lambda] (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."</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer programming</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Recursive functions</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Bergstra, Jan A.</subfield><subfield code="d">1951-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)123304881</subfield><subfield code="4">aut</subfield></datafield><datafield tag="810" ind1="2" ind2=" "><subfield code="a">Department of Computer Science: Report CS</subfield><subfield code="t">Centrum voor Wiskunde en Informatica <Amsterdam></subfield><subfield code="v">89,20</subfield><subfield code="w">(DE-604)BV008928356</subfield><subfield code="9">89,20</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-006160013</subfield></datafield></record></collection> |
| id | DE-604.BV009257903 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T17:34:00Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-006160013 |
| oclc_num | 22883476 |
| open_access_boolean | |
| owner | DE-29T |
| owner_facet | DE-29T |
| physical | 15 S. |
| publishDate | 1989 |
| publishDateSearch | 1989 |
| publishDateSort | 1989 |
| record_format | marc |
| series2 | Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS |
| spelling | Baeten, Josephus C. M. Verfasser aut Recursive process definitions with the state operator J. C. M. Baeten, J. A. Bergstra Amsterdam 1989 15 S. txt rdacontent n rdamedia nc rdacarrier Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS 89,20 Abstract: "We investigate the defining power of finite recursive specifications over the theory with + (alternative composition and . (sequential composition and [lambda] (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." Computer programming Recursive functions Bergstra, Jan A. 1951- Verfasser (DE-588)123304881 aut Department of Computer Science: Report CS Centrum voor Wiskunde en Informatica <Amsterdam> 89,20 (DE-604)BV008928356 89,20 |
| spellingShingle | Baeten, Josephus C. M. Bergstra, Jan A. 1951- Recursive process definitions with the state operator Computer programming Recursive functions |
| title | Recursive process definitions with the state operator |
| title_auth | Recursive process definitions with the state operator |
| title_exact_search | Recursive process definitions with the state operator |
| title_full | Recursive process definitions with the state operator J. C. M. Baeten, J. A. Bergstra |
| title_fullStr | Recursive process definitions with the state operator J. C. M. Baeten, J. A. Bergstra |
| title_full_unstemmed | Recursive process definitions with the state operator J. C. M. Baeten, J. A. Bergstra |
| title_short | Recursive process definitions with the state operator |
| title_sort | recursive process definitions with the state operator |
| topic | Computer programming Recursive functions |
| topic_facet | Computer programming Recursive functions |
| volume_link | (DE-604)BV008928356 |
| work_keys_str_mv | AT baetenjosephuscm recursiveprocessdefinitionswiththestateoperator AT bergstrajana recursiveprocessdefinitionswiththestateoperator |