On composition and lookahead delegation of e-services modeled by automata
- Author
- ZHE DANG1 ; IBARRA, Oscar H2 ; JIANWEN SU2
[1] School of Electrical Engineering and Computer Science, Washington State University, Pullman, WA 99164, United States
[2] Department of Computer Science, University of California, Santa Barbara, CA 93106, United States - Source
Theoretical computer science. 2005, Vol 341, Num 1-3, pp 344-363, 20 p ; ref : 29 ref
- CODEN
- TCSCDI
- ISSN
- 0304-3975
- Scientific domain
- Computer science
- Publisher
- Elsevier, Amsterdam
- Publication country
- Netherlands
- Document type
- Article
- Language
- English
- Author keyword
- Automated composition Decidable Delegator E-service modelling E-services Finite- state automata Infinite-state automata Lookahead delegation Undecidable
- Keyword (fr)
- Assignation Automate déterministe Automate fini Automate à pile Décidabilité Entrée ordinateur Informatique théorique Pile mémoire Stockage Automate état fini Automate état infini Composition automatisée Délégateur Modelisation E service
- Keyword (en)
- Assignment Deterministic automaton Finite automaton Push down automaton Decidability Input Computer theory Stack Storage Infinite state automaton Automated composition Delegator E service modelling
- Keyword (es)
- Asignación Autómata determinista Autómata estado finito Autómata a pila Decidibilidad Entrada ordenador Informática teórica Pila Almacenamiento
- Classification
- Pascal
- 001 Exact sciences and technology / 001D Applied sciences / 001D02 Computer science; control theory; systems / 001D02A Theoretical computing / 001D02A03 Automata. Abstract machines. Turing machines
- Pascal
- 001 Exact sciences and technology / 001D Applied sciences / 001D02 Computer science; control theory; systems / 001D02A Theoretical computing / 001D02A05 Algorithmics. Computability. Computer arithmetics
- Discipline
- Computer science : theoretical automation and systems
- Origin
- Inist-CNRS
- Database
- PASCAL
- INIST identifier
- 17046592
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Access to the document
Install on your browser
DOI
10.1016/j.tcs.2005.06.009 
https://dx.doi.org/10.1016/j.tcs.2005.06.009
"O:13:\"PanistOpenUrl\":36:{s:10:\"\u0000*\u0000openUrl\";N;s:6:\"\u0000*\u0000idc\";N;s:6:\"\u0000*\u0000fmt\";s:7:\"journal\";s:6:\"\u0000*\u0000doi\";s:25:\"10.1016\/j.tcs.2005.06.009\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:73:\"On composition and lookahead delegation of e-services modeled by automata\";s:9:\"\u0000*\u0000jtitle\";s:28:\"Theoretical computer science\";s:9:\"\u0000*\u0000stitle\";s:18:\"Theor. comput. sci\";s:7:\"\u0000*\u0000date\";s:4:\"2005\";s:9:\"\u0000*\u0000volume\";s:3:\"341\";s:8:\"\u0000*\u0000issue\";s:3:\"1-3\";s:8:\"\u0000*\u0000spage\";s:3:\"344\";s:8:\"\u0000*\u0000epage\";s:3:\"363\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"0304-3975\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:8:\"ZHE DANG\";s:10:\"\u0000*\u0000aufirst\";s:0:\"\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:2:{i:0;s:15:\"IBARRA, Oscar H\";i:1;s:10:\"JIANWEN SU\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:6:\"TCSCDI\";s:8:\"\u0000*\u0000genre\";s:7:\"article\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:0:\"\";s:8:\"\u0000*\u0000title\";s:73:\"On composition and lookahead delegation of e-services modeled by automata\";s:8:\"\u0000*\u0000place\";s:9:\"Amsterdam\";s:6:\"\u0000*\u0000pub\";s:8:\"Elsevier\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:2:\"20\";s:9:\"\u0000*\u0000series\";s:0:\"\";s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";b:1;}"
Panist access
"O:12:\"IstexOpenUrl\":35:{s:10:\"\u0000*\u0000openUrl\";N;s:6:\"\u0000*\u0000fmt\";s:7:\"journal\";s:6:\"\u0000*\u0000doi\";s:25:\"10.1016\/j.tcs.2005.06.009\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:73:\"On composition and lookahead delegation of e-services modeled by automata\";s:9:\"\u0000*\u0000jtitle\";s:28:\"Theoretical computer science\";s:9:\"\u0000*\u0000stitle\";s:18:\"Theor. comput. sci\";s:7:\"\u0000*\u0000date\";s:4:\"2005\";s:9:\"\u0000*\u0000volume\";s:3:\"341\";s:8:\"\u0000*\u0000issue\";s:3:\"1-3\";s:8:\"\u0000*\u0000spage\";s:3:\"344\";s:8:\"\u0000*\u0000epage\";s:3:\"363\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"0304-3975\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:8:\"ZHE DANG\";s:10:\"\u0000*\u0000aufirst\";s:0:\"\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:2:{i:0;s:15:\"IBARRA, Oscar H\";i:1;s:10:\"JIANWEN SU\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:6:\"TCSCDI\";s:8:\"\u0000*\u0000genre\";s:7:\"article\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:0:\"\";s:8:\"\u0000*\u0000title\";s:73:\"On composition and lookahead delegation of e-services modeled by automata\";s:8:\"\u0000*\u0000place\";s:9:\"Amsterdam\";s:6:\"\u0000*\u0000pub\";s:8:\"Elsevier\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:2:\"20\";s:9:\"\u0000*\u0000series\";s:0:\"\";s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";b:1;}"
Istex access
"O:16:\"UnpaywallOpenUrl\":35:{s:8:\"\u0000*\u0000email\";s:27:\"assistance-portail@inist.fr\";s:6:\"\u0000*\u0000fmt\";N;s:6:\"\u0000*\u0000doi\";s:25:\"10.1016\/j.tcs.2005.06.009\";s:6:\"\u0000*\u0000pii\";N;s:7:\"\u0000*\u0000pmid\";N;s:9:\"\u0000*\u0000atitle\";N;s:9:\"\u0000*\u0000jtitle\";N;s:9:\"\u0000*\u0000stitle\";N;s:7:\"\u0000*\u0000date\";N;s:9:\"\u0000*\u0000volume\";N;s:8:\"\u0000*\u0000issue\";N;s:8:\"\u0000*\u0000spage\";N;s:8:\"\u0000*\u0000epage\";N;s:8:\"\u0000*\u0000pages\";N;s:7:\"\u0000*\u0000issn\";N;s:8:\"\u0000*\u0000eissn\";N;s:9:\"\u0000*\u0000aulast\";N;s:10:\"\u0000*\u0000aufirst\";N;s:9:\"\u0000*\u0000auinit\";N;s:10:\"\u0000*\u0000auinitm\";N;s:5:\"\u0000*\u0000au\";N;s:9:\"\u0000*\u0000aucorp\";N;s:7:\"\u0000*\u0000isbn\";N;s:8:\"\u0000*\u0000coden\";N;s:8:\"\u0000*\u0000genre\";N;s:7:\"\u0000*\u0000part\";N;s:9:\"\u0000*\u0000btitle\";N;s:8:\"\u0000*\u0000title\";N;s:8:\"\u0000*\u0000place\";N;s:6:\"\u0000*\u0000pub\";N;s:10:\"\u0000*\u0000edition\";N;s:9:\"\u0000*\u0000tpages\";N;s:9:\"\u0000*\u0000series\";N;s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";N;}"
Unpaywall access
"O:16:\"EuropePMCOpenUrl\":35:{s:10:\"\u0000*\u0000openUrl\";N;s:6:\"\u0000*\u0000fmt\";s:7:\"journal\";s:6:\"\u0000*\u0000doi\";s:25:\"10.1016\/j.tcs.2005.06.009\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:73:\"On composition and lookahead delegation of e-services modeled by automata\";s:9:\"\u0000*\u0000jtitle\";s:28:\"Theoretical computer science\";s:9:\"\u0000*\u0000stitle\";s:18:\"Theor. comput. sci\";s:7:\"\u0000*\u0000date\";s:4:\"2005\";s:9:\"\u0000*\u0000volume\";s:3:\"341\";s:8:\"\u0000*\u0000issue\";s:3:\"1-3\";s:8:\"\u0000*\u0000spage\";s:3:\"344\";s:8:\"\u0000*\u0000epage\";s:3:\"363\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"0304-3975\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:8:\"ZHE DANG\";s:10:\"\u0000*\u0000aufirst\";s:0:\"\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:2:{i:0;s:15:\"IBARRA, Oscar H\";i:1;s:10:\"JIANWEN SU\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:6:\"TCSCDI\";s:8:\"\u0000*\u0000genre\";s:7:\"article\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:0:\"\";s:8:\"\u0000*\u0000title\";s:73:\"On composition and lookahead delegation of e-services modeled by automata\";s:8:\"\u0000*\u0000place\";s:9:\"Amsterdam\";s:6:\"\u0000*\u0000pub\";s:8:\"Elsevier\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:2:\"20\";s:9:\"\u0000*\u0000series\";s:0:\"\";s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";b:1;}"
Europe PubMed Central access
"O:12:\"ArXivOpenUrl\":35:{s:10:\"\u0000*\u0000openUrl\";N;s:6:\"\u0000*\u0000fmt\";s:7:\"journal\";s:6:\"\u0000*\u0000doi\";s:25:\"10.1016\/j.tcs.2005.06.009\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:73:\"On composition and lookahead delegation of e-services modeled by automata\";s:9:\"\u0000*\u0000jtitle\";s:28:\"Theoretical computer science\";s:9:\"\u0000*\u0000stitle\";s:18:\"Theor. comput. sci\";s:7:\"\u0000*\u0000date\";s:4:\"2005\";s:9:\"\u0000*\u0000volume\";s:3:\"341\";s:8:\"\u0000*\u0000issue\";s:3:\"1-3\";s:8:\"\u0000*\u0000spage\";s:3:\"344\";s:8:\"\u0000*\u0000epage\";s:3:\"363\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"0304-3975\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:8:\"ZHE DANG\";s:10:\"\u0000*\u0000aufirst\";s:0:\"\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:2:{i:0;s:15:\"IBARRA, Oscar H\";i:1;s:10:\"JIANWEN SU\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:6:\"TCSCDI\";s:8:\"\u0000*\u0000genre\";s:7:\"article\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:0:\"\";s:8:\"\u0000*\u0000title\";s:73:\"On composition and lookahead delegation of e-services modeled by automata\";s:8:\"\u0000*\u0000place\";s:9:\"Amsterdam\";s:6:\"\u0000*\u0000pub\";s:8:\"Elsevier\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:2:\"20\";s:9:\"\u0000*\u0000series\";s:0:\"\";s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";b:1;}"
arXiv access
