Foundations of computation theory: proceedings of the 1983 International FCT-Conference, Borgholm, Sweden, August 21 - 27, 1983
Gespeichert in:
| Format: | Tagungsbericht Buch |
|---|---|
| Sprache: | English |
| Veröffentlicht: |
Berlin [u.a.]
Springer
1983
|
| Schriftenreihe: | Lecture notes in computer science
158 |
| Schlagworte: | |
| Online-Zugang: | Inhaltsverzeichnis |
| Beschreibung: | XI, 514 S. Ill. |
| ISBN: | 3540126899 0387126899 |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV000148749 | ||
| 003 | DE-604 | ||
| 005 | 20110819 | ||
| 007 | t | ||
| 008 | 870612s1983 a||| |||| 10||| eng d | ||
| 020 | |a 3540126899 |9 3-540-12689-9 | ||
| 020 | |a 0387126899 |9 0-387-12689-9 | ||
| 035 | |a (OCoLC)9826839 | ||
| 035 | |a (DE-599)BVBBV000148749 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-12 |a DE-91G |a DE-384 |a DE-703 |a DE-739 |a DE-20 |a DE-29T |a DE-19 |a DE-11 |a DE-634 |a DE-706 |a DE-188 | ||
| 050 | 0 | |a QA267 | |
| 082 | 0 | |a 001.64/2 |2 19 | |
| 084 | |a SS 4800 |0 (DE-625)143528: |2 rvk | ||
| 084 | |a DAT 520f |2 stub | ||
| 084 | |a DAT 530f |2 stub | ||
| 084 | |a DAT 542f |2 stub | ||
| 084 | |a DAT 001f |2 stub | ||
| 245 | 1 | 0 | |a Foundations of computation theory |b proceedings of the 1983 International FCT-Conference, Borgholm, Sweden, August 21 - 27, 1983 |c ed. by Marek Karpinski |
| 264 | 1 | |a Berlin [u.a.] |b Springer |c 1983 | |
| 300 | |a XI, 514 S. |b Ill. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Lecture notes in computer science |v 158 | |
| 650 | 4 | |a Automates mathématiques, Théorie des - Congrès | |
| 650 | 7 | |a Automates mathématiques, Théorie des - Congrès |2 ram | |
| 650 | 4 | |a Complexité de calcul (Informatique) - Congrès | |
| 650 | 7 | |a Complexité de calcul (informatique) - Congrès |2 ram | |
| 650 | 7 | |a algorithme |2 inriac | |
| 650 | 7 | |a analyse algorithme |2 inriac | |
| 650 | 7 | |a analyse récursive |2 inriac | |
| 650 | 7 | |a automatique |2 inriac | |
| 650 | 7 | |a codage donnée |2 inriac | |
| 650 | 7 | |a combinatoire |2 inriac | |
| 650 | 7 | |a complexité calcul |2 inriac | |
| 650 | 7 | |a décidabilité |2 inriac | |
| 650 | 7 | |a grammaire formelle |2 inriac | |
| 650 | 7 | |a homotopie |2 inriac | |
| 650 | 7 | |a informatique fondamentale |2 inriac | |
| 650 | 7 | |a informatique théorique |2 inriac | |
| 650 | 7 | |a langage formel |2 inriac | |
| 650 | 7 | |a logique |2 inriac | |
| 650 | 7 | |a probabilité combinatoire |2 inriac | |
| 650 | 7 | |a réseau |2 inriac | |
| 650 | 7 | |a sémantique dénotationnelle |2 inriac | |
| 650 | 7 | |a théorie automate |2 inriac | |
| 650 | 7 | |a théorie graphe |2 inriac | |
| 650 | 4 | |a Computational complexity |v Congresses | |
| 650 | 4 | |a Machine theory |v Congresses | |
| 650 | 0 | 7 | |a Berechenbarkeit |0 (DE-588)4138368-0 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Informatik |0 (DE-588)4026894-9 |2 gnd |9 rswk-swf |
| 655 | 7 | |0 (DE-588)1071861417 |a Konferenzschrift |y 1983 |z Borgholm |2 gnd-content | |
| 689 | 0 | 0 | |a Informatik |0 (DE-588)4026894-9 |D s |
| 689 | 0 | |5 DE-604 | |
| 689 | 1 | 0 | |a Berechenbarkeit |0 (DE-588)4138368-0 |D s |
| 689 | 1 | |5 DE-604 | |
| 700 | 1 | |a Karpiński, Marek |d 1948- |e Sonstige |0 (DE-588)115476032 |4 oth | |
| 711 | 2 | |a International FCT Conference |n 4. |d 1983 |c Borgholm |j Sonstige |0 (DE-588)808017-3 |4 oth | |
| 830 | 0 | |a Lecture notes in computer science |v 158 |w (DE-604)BV000000607 |9 158 | |
| 856 | 4 | 2 | |m KOBV Fremddatenuebernahme |q application/pdf |u http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=000083101&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-000083101 | ||
Datensatz im Suchindex
| _version_ | 1804114607704375296 |
|---|---|
| adam_text | Foundations of Computation Theory
FCT 83
August 21-27, 1983
Borgholm, Sweden
TABLE OF CONTENTS
S. Abramsky
Experiments, powerdomains and fully abstract models for applicative
multiprogramming ...................................................... 1
P. Berman
Deterministic dynamic logic of recursive programs is weaker than
dynamic logic ................................................................ 14
A. Brandstadt and K. Wagner
Reversal-bounded and visit-bounded realtime computations *............. 26
B. v. Braunmuhl and R. Verbeek
Input-driven languages are recognized in logn space ................... 4o
B. Chazelle
How to search in history .............................................. 52
R. L. Constable
Constructive mathematics as a programming logic 1։
Some principles of theory .................................................... 64
S. A. Cook
The classfication of problems which have fast parallel algorithms ... 78
G. Costa and C. Stirling
A fair calculus of communicating systems .............................. 94
K. Culik II and E. Welzl
Two way finite state generators ............................................. lo6
R. de Nicola
A complete set of axioms for a theory of communicating sequential
processes ............................................................. 115
M.J. Fischer
The consensus problem in unreliable distributed systems
(A brief survey) ............................................................ 127
Ph. Flajolet
Methods in the analysis of algorithms:
Evaluations of a recursive partitioning process ....................... 141
R. Freivalds
Space and reversal complexity of probabilistic one-way Turing machines
159
X
M „ burstr R. Lipton and L. Stockmeyer
Pseudorandom number generation and space complexity .................... 171
D. Harel
Recurring dominoes: Making the highly undecidable highly
understandable ......................................................... 177
D. Harel and R. Sherman
Propos.i ti.ona ! dynamic logic of flowcharts .......................... 195
S. Hertel and K. Mehlhorn
Fast, triangulation of simple polygons ................................. 2°7 ,
Y. Itxhaik and A. Yehudai
On containment problems for finite-turn languages ...................... 219
L. vûniga and C. Koubek
On languages generated by semigroups ................................... 232
H. Langmaack
Aspects of programs with finite modes ....................................... 241
F. T. Leighton and R.L. Rivest
Estimating a probability using finite memory ........................... 255
A. Lingas
The Greedy and Delauney triangulations are not bad in the average case
and
Minimum weight geometric triangulation of multi-connected polygons
is NP-complete ........................................................... 27o
A. Macintyre
Decision problems for exponential rings: The p-adic case ............... 285
M. G. Main and D.B. Benson
Functional behaviour of nondeterministic programs ............................ 29o
K. Mehlhorn and B.II. Schmidt
A single source shortest path algorithm for graphs with separators .. 3o2
G. L. Miller
Isomorphism toasting and canonical forms for k-contractable graphs
(A generalization of bounded valence and bounded genus) ................. 31o
R. Ochranovâ
Finding dominators ..................................................... 328
F. Orejas
Characterizing composability of abstract implementations ............... 335
R. Parikh
Propositional logics of programs: New directions ....................... 347
M. Protasi
A new probabilistic model for the study of algorithmic properties
of random graph problems ............................................... 3g0
K.W. Regan
On diagonalizat.i.on methods and the structure of language classes .... 3 68
XI
R. K. Reischuk
A new solution for the Byzantine Generals Problem ....................... 382
Q. Rödding
Modular decomposition of automata ....................................... 3 94
D. Sanella and M. Wirsing
A kernel language for algebraic specification and implementation .... 413
E. Shamir and E. Upfal
A fast construction of disjoint paths in communication networks ......... 4 23
H.-U. Simon
A tight ft (log log n) -bound or. the time for parallel RAM’s to compute
nondegenerated Boolean functions ........................................ 439
J. Smith
The identification of propositions and types .in Mart.i.n-Löf’s type-theory:
A programming example ................................................... 4 4 5
A. Szepietowski
Remarks on searching labyrinths by automata ............................. 457
S. Tison, M. Dauchet and G. Comyn
Metrical and ordered properties of powerdomains ......................... 465
P. Trum and D. Wotschke
Economy of description for program schemes .............................. 4 75
E . Ukkonen
On approximate string matching .......................................... 487
P. Urzyczyn
Deterministic context-free dyncimic logic is more expressive than
deterministic dynamic logic of regular programs ......................... 496
G. Winskel
A note on powerdomains and modality ..................................... 5o5
Late arrivals
D. Park
Reasoning with fairness constraints ..................................... 516
|
| any_adam_object | 1 |
| author_GND | (DE-588)115476032 |
| building | Verbundindex |
| bvnumber | BV000148749 |
| callnumber-first | Q - Science |
| callnumber-label | QA267 |
| callnumber-raw | QA267 |
| callnumber-search | QA267 |
| callnumber-sort | QA 3267 |
| callnumber-subject | QA - Mathematics |
| classification_rvk | SS 4800 |
| classification_tum | DAT 520f DAT 530f DAT 542f DAT 001f |
| ctrlnum | (OCoLC)9826839 (DE-599)BVBBV000148749 |
| dewey-full | 001.64/2 |
| dewey-hundreds | 000 - Computer science, information, general works |
| dewey-ones | 001 - Knowledge |
| dewey-raw | 001.64/2 |
| dewey-search | 001.64/2 |
| dewey-sort | 11.64 12 |
| dewey-tens | 000 - Computer science, information, general works |
| discipline | Allgemeines Informatik |
| format | Conference Proceeding Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>03157nam a2200781 cb4500</leader><controlfield tag="001">BV000148749</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20110819 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">870612s1983 a||| |||| 10||| eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">3540126899</subfield><subfield code="9">3-540-12689-9</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0387126899</subfield><subfield code="9">0-387-12689-9</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)9826839</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV000148749</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-12</subfield><subfield code="a">DE-91G</subfield><subfield code="a">DE-384</subfield><subfield code="a">DE-703</subfield><subfield code="a">DE-739</subfield><subfield code="a">DE-20</subfield><subfield code="a">DE-29T</subfield><subfield code="a">DE-19</subfield><subfield code="a">DE-11</subfield><subfield code="a">DE-634</subfield><subfield code="a">DE-706</subfield><subfield code="a">DE-188</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">QA267</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">001.64/2</subfield><subfield code="2">19</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">SS 4800</subfield><subfield code="0">(DE-625)143528:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">DAT 520f</subfield><subfield code="2">stub</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">DAT 530f</subfield><subfield code="2">stub</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">DAT 542f</subfield><subfield code="2">stub</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">DAT 001f</subfield><subfield code="2">stub</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Foundations of computation theory</subfield><subfield code="b">proceedings of the 1983 International FCT-Conference, Borgholm, Sweden, August 21 - 27, 1983</subfield><subfield code="c">ed. by Marek Karpinski</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Berlin [u.a.]</subfield><subfield code="b">Springer</subfield><subfield code="c">1983</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">XI, 514 S.</subfield><subfield code="b">Ill.</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">Lecture notes in computer science</subfield><subfield code="v">158</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Automates mathématiques, Théorie des - Congrès</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Automates mathématiques, Théorie des - Congrès</subfield><subfield code="2">ram</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Complexité de calcul (Informatique) - Congrès</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Complexité de calcul (informatique) - Congrès</subfield><subfield code="2">ram</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">algorithme</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">analyse algorithme</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">analyse récursive</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">automatique</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">codage donnée</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">combinatoire</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">complexité calcul</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">décidabilité</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">grammaire formelle</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">homotopie</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">informatique fondamentale</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">informatique théorique</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">langage formel</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">logique</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">probabilité combinatoire</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">réseau</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">sémantique dénotationnelle</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">théorie automate</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">théorie graphe</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computational complexity</subfield><subfield code="v">Congresses</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Machine theory</subfield><subfield code="v">Congresses</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Berechenbarkeit</subfield><subfield code="0">(DE-588)4138368-0</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Informatik</subfield><subfield code="0">(DE-588)4026894-9</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="655" ind1=" " ind2="7"><subfield code="0">(DE-588)1071861417</subfield><subfield code="a">Konferenzschrift</subfield><subfield code="y">1983</subfield><subfield code="z">Borgholm</subfield><subfield code="2">gnd-content</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Informatik</subfield><subfield code="0">(DE-588)4026894-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="1" ind2="0"><subfield code="a">Berechenbarkeit</subfield><subfield code="0">(DE-588)4138368-0</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Karpiński, Marek</subfield><subfield code="d">1948-</subfield><subfield code="e">Sonstige</subfield><subfield code="0">(DE-588)115476032</subfield><subfield code="4">oth</subfield></datafield><datafield tag="711" ind1="2" ind2=" "><subfield code="a">International FCT Conference</subfield><subfield code="n">4.</subfield><subfield code="d">1983</subfield><subfield code="c">Borgholm</subfield><subfield code="j">Sonstige</subfield><subfield code="0">(DE-588)808017-3</subfield><subfield code="4">oth</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Lecture notes in computer science</subfield><subfield code="v">158</subfield><subfield code="w">(DE-604)BV000000607</subfield><subfield code="9">158</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">KOBV Fremddatenuebernahme</subfield><subfield code="q">application/pdf</subfield><subfield code="u">http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=000083101&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA</subfield><subfield code="3">Inhaltsverzeichnis</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-000083101</subfield></datafield></record></collection> |
| genre | (DE-588)1071861417 Konferenzschrift 1983 Borgholm gnd-content |
| genre_facet | Konferenzschrift 1983 Borgholm |
| id | DE-604.BV000148749 |
| illustrated | Illustrated |
| indexdate | 2024-07-09T15:09:25Z |
| institution | BVB |
| institution_GND | (DE-588)808017-3 |
| isbn | 3540126899 0387126899 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-000083101 |
| oclc_num | 9826839 |
| open_access_boolean | |
| owner | DE-12 DE-91G DE-BY-TUM DE-384 DE-703 DE-739 DE-20 DE-29T DE-19 DE-BY-UBM DE-11 DE-634 DE-706 DE-188 |
| owner_facet | DE-12 DE-91G DE-BY-TUM DE-384 DE-703 DE-739 DE-20 DE-29T DE-19 DE-BY-UBM DE-11 DE-634 DE-706 DE-188 |
| physical | XI, 514 S. Ill. |
| publishDate | 1983 |
| publishDateSearch | 1983 |
| publishDateSort | 1983 |
| publisher | Springer |
| record_format | marc |
| series | Lecture notes in computer science |
| series2 | Lecture notes in computer science |
| spelling | Foundations of computation theory proceedings of the 1983 International FCT-Conference, Borgholm, Sweden, August 21 - 27, 1983 ed. by Marek Karpinski Berlin [u.a.] Springer 1983 XI, 514 S. Ill. txt rdacontent n rdamedia nc rdacarrier Lecture notes in computer science 158 Automates mathématiques, Théorie des - Congrès Automates mathématiques, Théorie des - Congrès ram Complexité de calcul (Informatique) - Congrès Complexité de calcul (informatique) - Congrès ram algorithme inriac analyse algorithme inriac analyse récursive inriac automatique inriac codage donnée inriac combinatoire inriac complexité calcul inriac décidabilité inriac grammaire formelle inriac homotopie inriac informatique fondamentale inriac informatique théorique inriac langage formel inriac logique inriac probabilité combinatoire inriac réseau inriac sémantique dénotationnelle inriac théorie automate inriac théorie graphe inriac Computational complexity Congresses Machine theory Congresses Berechenbarkeit (DE-588)4138368-0 gnd rswk-swf Informatik (DE-588)4026894-9 gnd rswk-swf (DE-588)1071861417 Konferenzschrift 1983 Borgholm gnd-content Informatik (DE-588)4026894-9 s DE-604 Berechenbarkeit (DE-588)4138368-0 s Karpiński, Marek 1948- Sonstige (DE-588)115476032 oth International FCT Conference 4. 1983 Borgholm Sonstige (DE-588)808017-3 oth Lecture notes in computer science 158 (DE-604)BV000000607 158 KOBV Fremddatenuebernahme application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=000083101&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis |
| spellingShingle | Foundations of computation theory proceedings of the 1983 International FCT-Conference, Borgholm, Sweden, August 21 - 27, 1983 Lecture notes in computer science Automates mathématiques, Théorie des - Congrès Automates mathématiques, Théorie des - Congrès ram Complexité de calcul (Informatique) - Congrès Complexité de calcul (informatique) - Congrès ram algorithme inriac analyse algorithme inriac analyse récursive inriac automatique inriac codage donnée inriac combinatoire inriac complexité calcul inriac décidabilité inriac grammaire formelle inriac homotopie inriac informatique fondamentale inriac informatique théorique inriac langage formel inriac logique inriac probabilité combinatoire inriac réseau inriac sémantique dénotationnelle inriac théorie automate inriac théorie graphe inriac Computational complexity Congresses Machine theory Congresses Berechenbarkeit (DE-588)4138368-0 gnd Informatik (DE-588)4026894-9 gnd |
| subject_GND | (DE-588)4138368-0 (DE-588)4026894-9 (DE-588)1071861417 |
| title | Foundations of computation theory proceedings of the 1983 International FCT-Conference, Borgholm, Sweden, August 21 - 27, 1983 |
| title_auth | Foundations of computation theory proceedings of the 1983 International FCT-Conference, Borgholm, Sweden, August 21 - 27, 1983 |
| title_exact_search | Foundations of computation theory proceedings of the 1983 International FCT-Conference, Borgholm, Sweden, August 21 - 27, 1983 |
| title_full | Foundations of computation theory proceedings of the 1983 International FCT-Conference, Borgholm, Sweden, August 21 - 27, 1983 ed. by Marek Karpinski |
| title_fullStr | Foundations of computation theory proceedings of the 1983 International FCT-Conference, Borgholm, Sweden, August 21 - 27, 1983 ed. by Marek Karpinski |
| title_full_unstemmed | Foundations of computation theory proceedings of the 1983 International FCT-Conference, Borgholm, Sweden, August 21 - 27, 1983 ed. by Marek Karpinski |
| title_short | Foundations of computation theory |
| title_sort | foundations of computation theory proceedings of the 1983 international fct conference borgholm sweden august 21 27 1983 |
| title_sub | proceedings of the 1983 International FCT-Conference, Borgholm, Sweden, August 21 - 27, 1983 |
| topic | Automates mathématiques, Théorie des - Congrès Automates mathématiques, Théorie des - Congrès ram Complexité de calcul (Informatique) - Congrès Complexité de calcul (informatique) - Congrès ram algorithme inriac analyse algorithme inriac analyse récursive inriac automatique inriac codage donnée inriac combinatoire inriac complexité calcul inriac décidabilité inriac grammaire formelle inriac homotopie inriac informatique fondamentale inriac informatique théorique inriac langage formel inriac logique inriac probabilité combinatoire inriac réseau inriac sémantique dénotationnelle inriac théorie automate inriac théorie graphe inriac Computational complexity Congresses Machine theory Congresses Berechenbarkeit (DE-588)4138368-0 gnd Informatik (DE-588)4026894-9 gnd |
| topic_facet | Automates mathématiques, Théorie des - Congrès Complexité de calcul (Informatique) - Congrès Complexité de calcul (informatique) - Congrès algorithme analyse algorithme analyse récursive automatique codage donnée combinatoire complexité calcul décidabilité grammaire formelle homotopie informatique fondamentale informatique théorique langage formel logique probabilité combinatoire réseau sémantique dénotationnelle théorie automate théorie graphe Computational complexity Congresses Machine theory Congresses Berechenbarkeit Informatik Konferenzschrift 1983 Borgholm |
| url | http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=000083101&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
| volume_link | (DE-604)BV000000607 |
| work_keys_str_mv | AT karpinskimarek foundationsofcomputationtheoryproceedingsofthe1983internationalfctconferenceborgholmswedenaugust21271983 AT internationalfctconferenceborgholm foundationsofcomputationtheoryproceedingsofthe1983internationalfctconferenceborgholmswedenaugust21271983 |