Automata, languages and programming: 20th international colloquium, ICALP 93 Lund, Sweden, July 5 - 9, 1993 ; proceedings
Gespeichert in:
| Format: | Tagungsbericht Buch |
|---|---|
| Sprache: | English |
| Veröffentlicht: |
Berlin [u.a.]
Springer
1993
|
| Schriftenreihe: | Lecture notes in computer science
700 |
| Schlagworte: | |
| Online-Zugang: | Inhaltsverzeichnis |
| Beschreibung: | Literaturangaben |
| Beschreibung: | XII, 697 S. graph. Darst. |
| ISBN: | 3540569391 0387569391 |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV008042596 | ||
| 003 | DE-604 | ||
| 005 | 20070419 | ||
| 007 | t| | ||
| 008 | 930719s1993 gw d||| |||| 10||| engod | ||
| 016 | 7 | |a 931145937 |2 DE-101 | |
| 020 | |a 3540569391 |9 3-540-56939-1 | ||
| 020 | |a 0387569391 |9 0-387-56939-1 | ||
| 035 | |a (OCoLC)28515815 | ||
| 035 | |a (DE-599)BVBBV008042596 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 044 | |a gw |c XA-DE | ||
| 049 | |a DE-91G |a DE-739 |a DE-384 |a DE-20 |a DE-19 |a DE-634 |a DE-83 |a DE-11 |a DE-188 |a DE-706 | ||
| 050 | 0 | |a QA267 | |
| 082 | 0 | |a 511.3 | |
| 084 | |a ST 130 |0 (DE-625)143588: |2 rvk | ||
| 084 | |a DAT 510f |2 stub | ||
| 084 | |a DAT 550f |2 stub | ||
| 084 | |a 28 |2 sdnb | ||
| 245 | 1 | 0 | |a Automata, languages and programming |b 20th international colloquium, ICALP 93 Lund, Sweden, July 5 - 9, 1993 ; proceedings |c A. Lingas ... (eds.) |
| 264 | 1 | |a Berlin [u.a.] |b Springer |c 1993 | |
| 300 | |a XII, 697 S. |b graph. Darst. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Lecture notes in computer science |v 700 | |
| 500 | |a Literaturangaben | ||
| 650 | 7 | |a Abstracte automaten |2 gtt | |
| 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 Langages formels - Congrès | |
| 650 | 7 | |a Langages formels - Congrès |2 ram | |
| 650 | 7 | |a Ordinateurs - Programmation - Congrès |2 ram | |
| 650 | 4 | |a Programmation (Informatique) - Congrès | |
| 650 | 7 | |a Programmeertalen |2 gtt | |
| 650 | 7 | |a Teoria Da Computacao |2 larpcal | |
| 650 | 7 | |a algorithme graphe |2 inriac | |
| 650 | 7 | |a algorithme parallèle |2 inriac | |
| 650 | 7 | |a algorithme réparti |2 inriac | |
| 650 | 7 | |a analyse algorithme |2 inriac | |
| 650 | 7 | |a automate |2 inriac | |
| 650 | 7 | |a calculabilité |2 inriac | |
| 650 | 7 | |a complexité calcul |2 inriac | |
| 650 | 7 | |a concurrence |2 inriac | |
| 650 | 7 | |a cryptographie |2 inriac | |
| 650 | 7 | |a géométrie algorithmique |2 inriac | |
| 650 | 7 | |a langage formel |2 inriac | |
| 650 | 7 | |a logique temporelle |2 inriac | |
| 650 | 7 | |a structure donnée |2 inriac | |
| 650 | 7 | |a théorie programmation |2 inriac | |
| 650 | 4 | |a Computer programming |v Congresses | |
| 650 | 4 | |a Formal languages |v Congresses | |
| 650 | 4 | |a Machine theory |v Congresses | |
| 650 | 0 | 7 | |a Automatentheorie |0 (DE-588)4003953-5 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Theoretische Informatik |0 (DE-588)4196735-5 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Formale Sprache |0 (DE-588)4017848-1 |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 1993 |z Lund |2 gnd-content | |
| 655 | 7 | |0 (DE-588)1071861417 |a Konferenzschrift |y 1994 |z Jerusalem |2 gnd-content | |
| 689 | 0 | 0 | |a Theoretische Informatik |0 (DE-588)4196735-5 |D s |
| 689 | 0 | |5 DE-604 | |
| 689 | 1 | 0 | |a Formale Sprache |0 (DE-588)4017848-1 |D s |
| 689 | 1 | |5 DE-604 | |
| 689 | 2 | 0 | |a Automatentheorie |0 (DE-588)4003953-5 |D s |
| 689 | 2 | |5 DE-604 | |
| 689 | 3 | 0 | |a Informatik |0 (DE-588)4026894-9 |D s |
| 689 | 3 | |5 DE-188 | |
| 700 | 1 | |a Lingas, Andrzej |e Sonstige |4 oth | |
| 711 | 2 | |a ICALP |n 20 |d 1993 |c Lund |j Sonstige |0 (DE-588)2130821-4 |4 oth | |
| 830 | 0 | |a Lecture notes in computer science |v 700 |w (DE-604)BV000000607 |9 700 | |
| 856 | 4 | 2 | |m DNB Datenaustausch |q application/pdf |u http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=005291534&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
| 943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-005291534 | |
Datensatz im Suchindex
| _version_ | 1820868054399057920 |
|---|---|
| adam_text |
TABLE OF CONTENTS
SESSION 1: PROGRAMS AND DATA STRUCTURES
PROGRAM RESULT CHECKING: A NEW APPROACH TO MAKING PROGRAMS MORE
RELIABLE (INVITED)
M. BLUM . 1
DYNAMIC INTERPOLATION SEARCH IN O(LOG LOG N) TIME
A. ANDERSSON AND C. MATISSON . 15
SEARCHING AMONG INTERVALS AND COMPACT ROUTING TABLES
G. N. FREDERICKSON.28
SESSION 2: APPROXIMATION COMPLEXITY
THE APPROXIMATION OF MAXIMUM SUBGRAPH PROBLEMS
C. LUND AND M. YANNAKAKIS . 40
POLYNOMIALLY BOUNDED MINIMIZATION PROBLEMS WHICH ARE HARD
TO APPROXIMATE
V. KANN . 52
PRIMAL-DUAL APPROXIMATION ALGORITHMS FOR INTEGRAL FLOW AND MULTICUT IN
TREES, WITH APPLICATIONS TO MATCHING AND SET COVER
N. GARG, V. V. VAZIRANI, AND M. YANNAKAKIS . 64
THE COMPLEXITY OF APPROXIMATING PSPACE-COMPLETE PROBLEMS
FOR HIERARCHICAL SPECIFICATIONS
M.V. MARALHE, H.B. BUNT III, AND S.S. RAVI . 76
SESSION 3: GRAPH ALGORITHMS
PROBLEMS ON PAIRS OF TREES AND THE FOUR COLOUR PROBLEM OF PLANAR GRAPHS
A. CZUMAJ AND A. GIBBONS . 88
CONSTRUCTING COMPETITIVE TOURS FROM LOCAL INFORMATION
B. KALYANASUNDARAM AND K.R. PRUHS . 102
TREEWIDTH AND PATHWIDTH OF PERMUTATION GRAPHS
H. BODLAENDER, T. KLOKS, AND D. KRATSCH. 114
A THEORY OF EVEN FUNCTIONALS AND THEIR ALGORITHMIC APPLICATIONS
J. W. JAROMCZYK AND G. IFWIGTEK. 126
SESSION 4: ALGORITHM ANALYSIS AND COMPUTATIONAL GEOMETRY
EXACT ASYMPTOTICS OF DIVIDE-AND-CONQUER RECURRENCES
P. FLAJOLET AND M. GOLIN . 137
OPTIMAL BOUNDS FOR THE CHANGE-MAKING PROBLEM
D. KOZEN AND S. ZAKS
. 150
BIBLIOGRAFISCHE INFORMATIONEN
HTTP://D-NB.INFO/931145937
X
THE COMPLEXITY OF W-BODY SIMULATION
J.H. REIF AND S.R. TATE. 162
A SIMPLE METHOD FOR RESOLVING DEGENERACIES IN DELAUNAY TRIANGULATIONS
M.B. DILLENCOURT AND W.D. SMITH. 177
SESSION 5: COMPLEXITY
FAULT-TOLERANCE AND COMPLEXITY (INVITED)
L. A. HEMACHANDRA . 189
REVERSAL-SPACE TRADE-OFFS FOR SIMULTANEOUS RESOURCE-BOUNDED
NONDETERMINISTIC TURING MACHINES
H. YAMAMOTO. 203
ON THE COMPUTATIONAL POWER OF DISCRETE HOPFIELD NETS
P. ORPONEN . 215
SESSION 6: PROBABILISTIC COMPLEXITY AND CRYPTOGRAPHY
ON RANDOMIZED VERSUS DETERMINISTIC COMPUTATION
M. KARPINSKI AND R. VERBEEK.227
LOWER BOUNDS FOR ONE-WAY PROBABILISTIC COMMUNICATION COMPLEXITY
F. ABLAYEV. 241
MAINTAINING DISCRETE PROBABILITY DISTRIBUTIONS OPTIMALLY
T. HAGERUP, K. MEHLHORN, AND I. MUNRO . 253
SECURE AND EFFICIENT OFF-LINE DIGITAL MONEY
M. FRANKLIN AND M. YUNG . 265
SESSION 7: COMPUTABILITY, FORMAL LANGUAGES AND AUTOMATA
COMPUTATIONAL DEPTH AND REDUCIBILITY
D. W. JUEDES, J.I. LATHROP, AND J.H. LUTZ . 277
LEARNABILITY: ADMISSIBLE, CO-FINITE, AND HYPERSIMPLE LANGUAGES
G. BALIGA AND J. CASE . 289
INCLUSION IS UNDECIDABLE FOR PATTERN LANGUAGES
T. JIANG, A. SALOMAA, K. SALOMAA, AND S. YU. 301
NEW DECIDABILITY RESULTS CONCERNING TWO-WAY COUNTER MACHINES
AND APPLICATIONS
O.H. IBARRA, T. JIANG, N. TRAN, AND H. WANG . 313
SESSION 8: LOGIC, FORMAL LANGUAGES AND AUTOMATA
COBHAM'S THEOREM SEEN THROUGH BIICHI'S THEOREM
C. MICHAUX AND R. VILLEMAIRE . 325
XI
LOGICAL DEFINABILITY ON INFINITE TRACES
W. EBINGER AND A. MUSCHOLL. 335
ALGEBRAS FOR CLASSIFYING REGULAR TREE LANGUAGES AND AN APPLICATION
TO FRONTIER TESTABILITY
T. WILKE.347
FINITE AUTOMATA AS CHARACTERIZATIONS OF MINOR CLOSED TREE FAMILIES
A. GUPTA . 359
SESSION 9: PARALLEL AND DISRIBUTED ALGORITHMS I
ON DISTRIBUTED ALGORITHMS IN A BROADCAST DOMAIN (INVITED)
D. DOLEV AND D. MALKI. 371
SPARSE NETWORKS SUPPORTING EFFICIENT RELIABLE BROADCASTING
B. S. CHLEBUS, K. DIKS, AND A. PELC.388
SESSION 10: PARALLEL AND DISRIBUTED ALGORITHMS II
STRONGLY ADAPTIVE TOKEN DISTRIBUTION
F. MEYER AUF DER HEIDE, B. OESTERDIEKHOFF, AND R. WANKA . 398
FAST PARALLEL COMPUTATION OF CHARACTERISTIC POLYNOMIALS BY LEVERRIER'S
POWER SUM METHOD ADAPTED TO FIELDS OF FINITE CHARACTERISTIC
A. SCHONHAGE . 410
FAST PARALLEL CONSTRAINT SATISFACTION
L.M. KIROUSIS.418
SESSION 11: ALGEBRAIC ASPECTS OF FORMAL LANGUAGES AND AUTOMATA I
THE PRODUCT OF RATIONAL LANGUAGES (INVITED)
I. SIMON . 430
ON REGULAR COMPATIBILITY OF SEMI-COMMUTATIONS
E. OCHMANSKI AND P.-A. WACRENIER. 445
ALGEBRAIC ASPECTS OF B-REGULAR SERIES
P. DUMAS.457
SESSION 12: ALGEBRAIC ASPECTS OF FORMAL LANGUAGES AND AUTOMATA II
PRODUCTS OF FINITE STATE MACHINES WITH FULL COVERAGE
D.M. COHEN AND M.L. FREDMAN . 469
AN EFFECTIVE VERSION OF STALLINGS' THEOREM IN THE CASE
OF CONTEXT-FREE GROUPS
G. SENIZERGUES . 478
ON THE POWER OF PERIODIC ITERATION OF MORPHISMS
A. LEPISTO . 496
IF A DOL LANGUAGE IS K-POWER FREE THEN IT IS CIRCULAR
F. MIGNOSI AND P. SEEBOLD . 507
XII
SESSION 13: CONCURRENCY
DECIDING TRUE CONCURRENCY EQUIVALENCES ON FINITE SAFE NETS
L. JATEGAONKAR AND A.R. MEYER. 519
TIMED TESTING OF CONCURRENT SYSTEMS
W. VOGLER . 532
THE FORK CALCULUS
K. HAVELNND AND K. G. LARSEN. 544
EXTENDED TRANSITION SYSTEMS FOR PARAMETRIC BISIMULATION
P. INVERARDI, C. PRIAMI, AND D. YANKELEVICH . 558
SESSION 14: TEMPORAL LOGIC
TEMPORAL LOGIC AND CATEGORIES OF PETRI NETS
C. BROWN AND D. GURR. 570
DECIDABILITY OF A PARTIAL ORDER BASED TEMPORAL LOGIC
K. LODAYA, R. RAMANUJAM, AND P.S. THIAGARAJAN . 582
LOCAL MODEL CHECKING FOR CONTEXT-FREE PROCESSES
H. HUNGAR AND B. STEFFEN . 593
SESSION 15: THEORY OF PROGRAMMING I
COMPUTING ON STRUCTURES (INVITED)
S. ABITEBOUL AND V. VIANU . 606
A PARTIAL SOLUTION FOR D-UNIFICATION BASED ON A REDUCTION
TO ACL-UNIFICATION
E. CONTEJEAN . 621
EFFICIENT ANALYSIS OF CONCURRENT CONSTRAINT LOGIC PROGRAMS
M. CODISH, M. FALASCHI, K. MARRIOTT, AND W. WINSBOROUGH . 633
SESSION 16: THEORY OF PROGRAMMING II
A CONFLUENT REDUCTION FOR THE EXTENSIONAL TYPED A-CALCULUS WITH PAIRS,
SUMS, RECURSION AND TERMINAL OBJECT
R. DI COSMO AND D. KESNER. 645
MODULARITY OF TERMINATION AND CONFLUENCE IN COMBINATIONS OF REWRITE
SYSTEMS WITH AW
F. BARBANERA AND M. FERNANDEZ. 657
FROM DOMAINS TO AUTOMATA WITH CONCURRENCY
F. BRACHO AND M. DROSTE . 669
WHAT IS A UNIVERSAL HIGHER-ORDER PROGRAMMING LANGUAGE?
R. KANNEGANTI AND R. CARTWRIGHT . 682
AUTHOR INDEX. 696 |
| any_adam_object | 1 |
| building | Verbundindex |
| bvnumber | BV008042596 |
| callnumber-first | Q - Science |
| callnumber-label | QA267 |
| callnumber-raw | QA267 |
| callnumber-search | QA267 |
| callnumber-sort | QA 3267 |
| callnumber-subject | QA - Mathematics |
| classification_rvk | ST 130 |
| classification_tum | DAT 510f DAT 550f |
| ctrlnum | (OCoLC)28515815 (DE-599)BVBBV008042596 |
| dewey-full | 511.3 |
| dewey-hundreds | 500 - Natural sciences and mathematics |
| dewey-ones | 511 - General principles of mathematics |
| dewey-raw | 511.3 |
| dewey-search | 511.3 |
| dewey-sort | 3511.3 |
| dewey-tens | 510 - Mathematics |
| discipline | Informatik Mathematik |
| format | Conference Proceeding Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>00000nam a2200000 cb4500</leader><controlfield tag="001">BV008042596</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20070419</controlfield><controlfield tag="007">t|</controlfield><controlfield tag="008">930719s1993 gw d||| |||| 10||| engod</controlfield><datafield tag="016" ind1="7" ind2=" "><subfield code="a">931145937</subfield><subfield code="2">DE-101</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">3540569391</subfield><subfield code="9">3-540-56939-1</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0387569391</subfield><subfield code="9">0-387-56939-1</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)28515815</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV008042596</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="044" ind1=" " ind2=" "><subfield code="a">gw</subfield><subfield code="c">XA-DE</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-91G</subfield><subfield code="a">DE-739</subfield><subfield code="a">DE-384</subfield><subfield code="a">DE-20</subfield><subfield code="a">DE-19</subfield><subfield code="a">DE-634</subfield><subfield code="a">DE-83</subfield><subfield code="a">DE-11</subfield><subfield code="a">DE-188</subfield><subfield code="a">DE-706</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">QA267</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">511.3</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ST 130</subfield><subfield code="0">(DE-625)143588:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">DAT 510f</subfield><subfield code="2">stub</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">DAT 550f</subfield><subfield code="2">stub</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">28</subfield><subfield code="2">sdnb</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Automata, languages and programming</subfield><subfield code="b">20th international colloquium, ICALP 93 Lund, Sweden, July 5 - 9, 1993 ; proceedings</subfield><subfield code="c">A. Lingas ... (eds.)</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Berlin [u.a.]</subfield><subfield code="b">Springer</subfield><subfield code="c">1993</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">XII, 697 S.</subfield><subfield code="b">graph. Darst.</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">700</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Literaturangaben</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Abstracte automaten</subfield><subfield code="2">gtt</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">Langages formels - Congrès</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Langages formels - Congrès</subfield><subfield code="2">ram</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Ordinateurs - Programmation - Congrès</subfield><subfield code="2">ram</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Programmation (Informatique) - Congrès</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Programmeertalen</subfield><subfield code="2">gtt</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Teoria Da Computacao</subfield><subfield code="2">larpcal</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">algorithme graphe</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">algorithme parallèle</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">algorithme réparti</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">automate</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">calculabilité</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">concurrence</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">cryptographie</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">géométrie algorithmique</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 temporelle</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">structure donnée</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">théorie programmation</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer programming</subfield><subfield code="v">Congresses</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Formal languages</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">Automatentheorie</subfield><subfield code="0">(DE-588)4003953-5</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Theoretische Informatik</subfield><subfield code="0">(DE-588)4196735-5</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Formale Sprache</subfield><subfield code="0">(DE-588)4017848-1</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">1993</subfield><subfield code="z">Lund</subfield><subfield code="2">gnd-content</subfield></datafield><datafield tag="655" ind1=" " ind2="7"><subfield code="0">(DE-588)1071861417</subfield><subfield code="a">Konferenzschrift</subfield><subfield code="y">1994</subfield><subfield code="z">Jerusalem</subfield><subfield code="2">gnd-content</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Theoretische Informatik</subfield><subfield code="0">(DE-588)4196735-5</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">Formale Sprache</subfield><subfield code="0">(DE-588)4017848-1</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="2" ind2="0"><subfield code="a">Automatentheorie</subfield><subfield code="0">(DE-588)4003953-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="2" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="3" 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="3" ind2=" "><subfield code="5">DE-188</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Lingas, Andrzej</subfield><subfield code="e">Sonstige</subfield><subfield code="4">oth</subfield></datafield><datafield tag="711" ind1="2" ind2=" "><subfield code="a">ICALP</subfield><subfield code="n">20</subfield><subfield code="d">1993</subfield><subfield code="c">Lund</subfield><subfield code="j">Sonstige</subfield><subfield code="0">(DE-588)2130821-4</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">700</subfield><subfield code="w">(DE-604)BV000000607</subfield><subfield code="9">700</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">DNB Datenaustausch</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=005291534&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA</subfield><subfield code="3">Inhaltsverzeichnis</subfield></datafield><datafield tag="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-005291534</subfield></datafield></record></collection> |
| genre | (DE-588)1071861417 Konferenzschrift 1993 Lund gnd-content (DE-588)1071861417 Konferenzschrift 1994 Jerusalem gnd-content |
| genre_facet | Konferenzschrift 1993 Lund Konferenzschrift 1994 Jerusalem |
| id | DE-604.BV008042596 |
| illustrated | Illustrated |
| indexdate | 2025-01-10T13:18:16Z |
| institution | BVB |
| institution_GND | (DE-588)2130821-4 |
| isbn | 3540569391 0387569391 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-005291534 |
| oclc_num | 28515815 |
| open_access_boolean | |
| owner | DE-91G DE-BY-TUM DE-739 DE-384 DE-20 DE-19 DE-BY-UBM DE-634 DE-83 DE-11 DE-188 DE-706 |
| owner_facet | DE-91G DE-BY-TUM DE-739 DE-384 DE-20 DE-19 DE-BY-UBM DE-634 DE-83 DE-11 DE-188 DE-706 |
| physical | XII, 697 S. graph. Darst. |
| publishDate | 1993 |
| publishDateSearch | 1993 |
| publishDateSort | 1993 |
| publisher | Springer |
| record_format | marc |
| series | Lecture notes in computer science |
| series2 | Lecture notes in computer science |
| spelling | Automata, languages and programming 20th international colloquium, ICALP 93 Lund, Sweden, July 5 - 9, 1993 ; proceedings A. Lingas ... (eds.) Berlin [u.a.] Springer 1993 XII, 697 S. graph. Darst. txt rdacontent n rdamedia nc rdacarrier Lecture notes in computer science 700 Literaturangaben Abstracte automaten gtt Automates mathématiques, Théorie des - Congrès Automates mathématiques, Théorie des - Congrès ram Langages formels - Congrès Langages formels - Congrès ram Ordinateurs - Programmation - Congrès ram Programmation (Informatique) - Congrès Programmeertalen gtt Teoria Da Computacao larpcal algorithme graphe inriac algorithme parallèle inriac algorithme réparti inriac analyse algorithme inriac automate inriac calculabilité inriac complexité calcul inriac concurrence inriac cryptographie inriac géométrie algorithmique inriac langage formel inriac logique temporelle inriac structure donnée inriac théorie programmation inriac Computer programming Congresses Formal languages Congresses Machine theory Congresses Automatentheorie (DE-588)4003953-5 gnd rswk-swf Theoretische Informatik (DE-588)4196735-5 gnd rswk-swf Formale Sprache (DE-588)4017848-1 gnd rswk-swf Informatik (DE-588)4026894-9 gnd rswk-swf (DE-588)1071861417 Konferenzschrift 1993 Lund gnd-content (DE-588)1071861417 Konferenzschrift 1994 Jerusalem gnd-content Theoretische Informatik (DE-588)4196735-5 s DE-604 Formale Sprache (DE-588)4017848-1 s Automatentheorie (DE-588)4003953-5 s Informatik (DE-588)4026894-9 s DE-188 Lingas, Andrzej Sonstige oth ICALP 20 1993 Lund Sonstige (DE-588)2130821-4 oth Lecture notes in computer science 700 (DE-604)BV000000607 700 DNB Datenaustausch application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=005291534&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis |
| spellingShingle | Automata, languages and programming 20th international colloquium, ICALP 93 Lund, Sweden, July 5 - 9, 1993 ; proceedings Lecture notes in computer science Abstracte automaten gtt Automates mathématiques, Théorie des - Congrès Automates mathématiques, Théorie des - Congrès ram Langages formels - Congrès Langages formels - Congrès ram Ordinateurs - Programmation - Congrès ram Programmation (Informatique) - Congrès Programmeertalen gtt Teoria Da Computacao larpcal algorithme graphe inriac algorithme parallèle inriac algorithme réparti inriac analyse algorithme inriac automate inriac calculabilité inriac complexité calcul inriac concurrence inriac cryptographie inriac géométrie algorithmique inriac langage formel inriac logique temporelle inriac structure donnée inriac théorie programmation inriac Computer programming Congresses Formal languages Congresses Machine theory Congresses Automatentheorie (DE-588)4003953-5 gnd Theoretische Informatik (DE-588)4196735-5 gnd Formale Sprache (DE-588)4017848-1 gnd Informatik (DE-588)4026894-9 gnd |
| subject_GND | (DE-588)4003953-5 (DE-588)4196735-5 (DE-588)4017848-1 (DE-588)4026894-9 (DE-588)1071861417 |
| title | Automata, languages and programming 20th international colloquium, ICALP 93 Lund, Sweden, July 5 - 9, 1993 ; proceedings |
| title_auth | Automata, languages and programming 20th international colloquium, ICALP 93 Lund, Sweden, July 5 - 9, 1993 ; proceedings |
| title_exact_search | Automata, languages and programming 20th international colloquium, ICALP 93 Lund, Sweden, July 5 - 9, 1993 ; proceedings |
| title_full | Automata, languages and programming 20th international colloquium, ICALP 93 Lund, Sweden, July 5 - 9, 1993 ; proceedings A. Lingas ... (eds.) |
| title_fullStr | Automata, languages and programming 20th international colloquium, ICALP 93 Lund, Sweden, July 5 - 9, 1993 ; proceedings A. Lingas ... (eds.) |
| title_full_unstemmed | Automata, languages and programming 20th international colloquium, ICALP 93 Lund, Sweden, July 5 - 9, 1993 ; proceedings A. Lingas ... (eds.) |
| title_short | Automata, languages and programming |
| title_sort | automata languages and programming 20th international colloquium icalp 93 lund sweden july 5 9 1993 proceedings |
| title_sub | 20th international colloquium, ICALP 93 Lund, Sweden, July 5 - 9, 1993 ; proceedings |
| topic | Abstracte automaten gtt Automates mathématiques, Théorie des - Congrès Automates mathématiques, Théorie des - Congrès ram Langages formels - Congrès Langages formels - Congrès ram Ordinateurs - Programmation - Congrès ram Programmation (Informatique) - Congrès Programmeertalen gtt Teoria Da Computacao larpcal algorithme graphe inriac algorithme parallèle inriac algorithme réparti inriac analyse algorithme inriac automate inriac calculabilité inriac complexité calcul inriac concurrence inriac cryptographie inriac géométrie algorithmique inriac langage formel inriac logique temporelle inriac structure donnée inriac théorie programmation inriac Computer programming Congresses Formal languages Congresses Machine theory Congresses Automatentheorie (DE-588)4003953-5 gnd Theoretische Informatik (DE-588)4196735-5 gnd Formale Sprache (DE-588)4017848-1 gnd Informatik (DE-588)4026894-9 gnd |
| topic_facet | Abstracte automaten Automates mathématiques, Théorie des - Congrès Langages formels - Congrès Ordinateurs - Programmation - Congrès Programmation (Informatique) - Congrès Programmeertalen Teoria Da Computacao algorithme graphe algorithme parallèle algorithme réparti analyse algorithme automate calculabilité complexité calcul concurrence cryptographie géométrie algorithmique langage formel logique temporelle structure donnée théorie programmation Computer programming Congresses Formal languages Congresses Machine theory Congresses Automatentheorie Theoretische Informatik Formale Sprache Informatik Konferenzschrift 1993 Lund Konferenzschrift 1994 Jerusalem |
| url | http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=005291534&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
| volume_link | (DE-604)BV000000607 |
| work_keys_str_mv | AT lingasandrzej automatalanguagesandprogramming20thinternationalcolloquiumicalp93lundswedenjuly591993proceedings AT icalplund automatalanguagesandprogramming20thinternationalcolloquiumicalp93lundswedenjuly591993proceedings |