Automata, languages and programming: 25th international colloquium, ICALP '98, Aalborg, Denmark, July 13 - 17, 1998 ; proceedings
Gespeichert in:
Format: | Tagungsbericht Buch |
---|---|
Sprache: | English |
Veröffentlicht: |
Berlin [u.a.]
Springer
1998
|
Schriftenreihe: | Lecture notes in computer science
1443 |
Schlagworte: | |
Online-Zugang: | Inhaltsverzeichnis |
Beschreibung: | XVI, 932 S. graph. Darst. |
ISBN: | 3540647813 |
Internformat
MARC
LEADER | 00000nam a2200000 cb4500 | ||
---|---|---|---|
001 | BV012057354 | ||
003 | DE-604 | ||
005 | 20161012 | ||
007 | t| | ||
008 | 980707s1998 gw d||| |||| 10||| eng d | ||
016 | 7 | |a 953907864 |2 DE-101 | |
020 | |a 3540647813 |9 3-540-64781-3 | ||
035 | |a (OCoLC)39714746 | ||
035 | |a (DE-599)BVBBV012057354 | ||
040 | |a DE-604 |b ger |e rakddb | ||
041 | 0 | |a eng | |
044 | |a gw |c DE | ||
049 | |a DE-739 |a DE-384 |a DE-91G |a DE-20 |a DE-824 |a DE-19 |a DE-521 |a DE-634 |a DE-83 |a DE-188 |a DE-706 | ||
050 | 0 | |a QA267 | |
082 | 0 | |a 005.1 |2 21 | |
084 | |a ST 240 |0 (DE-625)143625: |2 rvk | ||
084 | |a DAT 550f |2 stub | ||
084 | |a 28 |2 sdnb | ||
245 | 1 | 0 | |a Automata, languages and programming |b 25th international colloquium, ICALP '98, Aalborg, Denmark, July 13 - 17, 1998 ; proceedings |c Kim G. Larsen ... (eds.) |
264 | 1 | |a Berlin [u.a.] |b Springer |c 1998 | |
300 | |a XVI, 932 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 1443 | |
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 | 4 | |a Programmation (Informatique) - Congrès | |
650 | 7 | |a Programmeertalen |2 gtt | |
650 | 7 | |a automate |2 inriac | |
650 | 7 | |a complexité calcul |2 inriac | |
650 | 7 | |a concurrence |2 inriac | |
650 | 7 | |a langage formel |2 inriac | |
650 | 7 | |a logique |2 inriac | |
650 | 7 | |a pi calcul |2 inriac | |
650 | 7 | |a réécriture |2 inriac | |
650 | 7 | |a structure donnée |2 inriac | |
650 | 7 | |a sémantique |2 inriac | |
650 | 7 | |a vérification |2 inriac | |
650 | 4 | |a Informatik | |
650 | 4 | |a Mathematik | |
650 | 4 | |a Computer science |x Mathematics |v Congresses | |
650 | 4 | |a Machine theory |v Congresses | |
650 | 4 | |a Programming languages (Electronic computers) |v Congresses | |
650 | 0 | 7 | |a Theoretische Informatik |0 (DE-588)4196735-5 |2 gnd |9 rswk-swf |
655 | 7 | |0 (DE-588)1071861417 |a Konferenzschrift |y 1998 |z Ålborg |2 gnd-content | |
689 | 0 | 0 | |a Theoretische Informatik |0 (DE-588)4196735-5 |D s |
689 | 0 | |5 DE-604 | |
700 | 1 | |a Larsen, Kim Guldstrand |d 1957- |e Sonstige |0 (DE-588)111582192X |4 oth | |
711 | 2 | |a ICALP |n 25 |d 1998 |c Ålborg |j Sonstige |0 (DE-588)2170890-3 |4 oth | |
830 | 0 | |a Lecture notes in computer science |v 1443 |w (DE-604)BV000000607 |9 1443 | |
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=008160721&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-008160721 |
Datensatz im Suchindex
_version_ | 1820874876204875776 |
---|---|
adam_text |
TABLE
OF
CONTENTS
INVITED
LECTURE:
ALGORITHMIC
VERIFICATION
OF
LINEAR
TEMPORAL
LOGIC
SPECIFICATIONS
Y.
KESTEN,
A.
PNUELI,
L.-O.
RAVIV
.
1
COMPLEXITY:
ON
EXISTENTIALLY
FIRST-ORDER
DEFINABLE
LANGUAGES
AND
THEIR
RELATION
TO
NP
B.
BORCHERT,
D.
KUSKE,
F.
STEPHAN
.
17
AN
ALGEBRAIC
APPROACH
TO
COMMUNICATION
COMPLEXITY
J.-F.
RAYMOND,
P.
TESSON,
D.
THERIEN
.
29
VERIFICATION:
DECIDING
GLOBAL
PARTIAL-ORDER
PROPERTIES
R.
ALUR,
K.
MCMILLAN,
D.
PELED
.
41
SIMPLE
LINEAR-TIME
ALGORITHMS
FOR
MINIMAL
FIXED
POINTS
X.
LIU,
S.
A.
SMOLKA
.
53
DATA
STRUCTURES:
HARDNESS
RESULTS
FOR
DYNAMIC
PROBLEMS
BY
EXTENSIONS
OF
FREDMAN
AND
SAKS
'
CHRONOGRAM
METHOD
T.
HUSFELDT,
T.
RAUHE
.
67
SIMPLER
AND
FASTER
DICTIONARIES
ON
THE
AC
0
RAM
T.
HAGERUP
.
79
CONCURRENCY:
PARTIAL-CONGRUENCE
FACTORIZATION
OF
BISIMILARITY
INDUCED
BY
OPEN
MAPS
S.
LASOTA
.
91
RESET
NETS
BETWEEN
DECIDABILITY
AND
UNDECIDABILITY
C.
DUFOURD,
A.
FINKEL,
PH.
SCHNOEBELEN
.
103
INVITED
LECTURE:
GEOMETRIC
ALGORITHMS
FOR
ROBOTIC
MANIPULATION
M.
H.
OVERMARS
.
116
COMPUTATIONAL
GEOMETRY:
COMPACT
ENCODINGS
OF
PLANAR
GRAPHS
VIA
CANONICAL
ORDERINGS
AND
MULTIPLE
PARENTHESES
R.
C.
CHUANG,
A.
GARG,
X.
HE,
M.
KAO,
H.
LU
.
118
REDUCING
SIMPLE
POLYGONS
TO
TRIANGLES
-
A
PROOF
FOR
AN
IMPROVED
CONJECTURE
T.
GRAF,
K.
VEEZHINATHAN
.
130
XII
AUTOMATA
AND
TEMPORAL
LOGIC:
DIFFICULT
CONFIGURATIONS
-
ON
THE
COMPLEXITY
OF
LTRL
I.
WALUKIEWICZ
.
140
ON
THE
EXPRESSIVENESS
OF
REAL
AND
INTEGER
ARITHMETIC
AUTOMATA
B.
BOIGELOT,
S.
RASSART,
P.
WOLPER
.
152
ALGORITHMS:
DISTRIBUTED
MATROID
BASIS
COMPLETION
VIA
ELIMINATION
UPCAST
AND
DISTRIBUTED
CORRECTION
OF
MINIMUM-WEIGHT
SPANNING
TREES
D.
PELEG
.
164
INDEPENDENT
SETS
WITH
DOMINATION
CONSTRAINTS
M.
M.
HALLDDRSSON,
J.
KRATOCHVD,
J.
A.
TELLE
.
176
INFINITE
STATE
SYSTEMS:
ROBUST
ASYNCHRONOUS
PROTOCOLS
ARE
FINITE-STATE
M.
MUKUND,
K.
N.
KUMAR,
J.
RADHAKRISHNAN,
M.
SOHONI
.
188
DECIDING
BISIMULATION-LIKE
EQUIVALENCES
WITH
FINITE-STATE
PROCESSES
P.
JANCAR,
A.
KUCERA,
R.
MAYR
.
200
INVITED
LECTURE:
DO
PROBABILISTIC
ALGORITHMS
OUTPERFORM
DETERMINISTIC
ONES?
A.
WIGDERSON
.
212
COMPLEXITY:
A
DEGREE-DECREASING
LEMMA
FOR
(MOD
Q,
MOD
P)
CIRCUITS
V.
GROLMUSZ
.
215
IMPROVED
PSEUDORANDOM
GENERATORS
FOR
COMBINATORIAL
RECTANGLES
C.-J.
LU
.
223
VERIFICATION:
TRANSLATION
VALIDATION
FOR
SYNCHRONOUS
LANGUAGES
A.
PNUELI,
0.
SHTRICHMAN,
M.
SIEGEL
.
235
AN
EFFICIENT
AND
UNIFIED
APPROACH
TO
THE
DECIDABILITY
OF
EQUIVALENCE
OF
PROPOSITIONAL
PROGRAMS
V.
A.
ZAKHAROV
.
247
COMPLEXITY:
ON
BRANCHING
PROGRAMS
WITH
BOUNDED
UNCERTAINTY
S.
JUKNA,
S.
ZAK
.
259
CONS-FREE
PROGRAMS
WITH
TREE
INPUT
A.
M.
BEN-AMRAM,
H.
PETERSEN
.
271
CONCURRENCY:
CONCATENABLE
GRAPH
PROCESSES:
RELATING
PROCESSES
AND
DERIVATION
TRACES
P.
BALDAN,
A.
CORRADINI,
U.
MONTANARI
.
283
XIII
AXIOMS
FOR
CONTEXTUAL
NET
PROCESSES
F.
GADDUCCI,
U.
MONTANARI
.
296
INVITED
LECTURE:
EXISTENTIAL
TYPES:
LOGICAL
RELATIONS
AND
OPERATIONAL
EQUIVALENCE
A.
M.
PITTS
.
309
ALGORITHMS:
OPTIMAL
SAMPLING
STRATEGIES
IN
QUICKSORT
C.
MARTINEZ,
S.
ROURA
.
327
A
GENUINELY
POLYNOMIAL-TIME
ALGORITHM
FOR
SAMPLING
TWO-ROWED
CONTINGENCY
TABLES
M.
DYER,
C.
GREENHILL
.
339
SEMANTICS:
A
MODULAR
APPROACH
TO
DENOTATIONAL
SEMANTICS
J.
POWER,
G.
ROSOLINI
.
351
GENERALISED
FLOWCHARTS
AND
GAMES
P.
MALACARIA,
C.
HANKIN
.
363
APPROXIMATION:
EFFICIENT
MINIMIZATION
OF
NUMERICAL
SUMMATION
ERRORS
M.-Y.
KAO,
J.
WANG
.
375
EFFICIENT
APPROXIMATION
ALGORITHMS
FOR
THE
SUBSET-SUMS
EQUALITY
PROBLEM
C.
BAZGAN,
M.
SANTHA,
Z.
TUZA
.
387
THEOREM
PROVING:
STRUCTURAL
RECURSIVE
DEFINITIONS
IN
TYPE
THEORY
E.
GIMENEZ
.
397
A
GOOD
CLASS
OF
TREE
AUTOMATA.
APPLICATION
TO
INDUCTIVE
THEOREM
PROVING
D.
LUGIEZ
.
409
FORMAL
LANGUAGES:
LOCALLY
PERIODIC
INFINITE
WORDS
AND
A
CHAOTIC
BEHAVIOUR
J.
KARHUMAKI,
A.
LEPISTO,
W.
PLANDOWSKI
.
421
BRIDGES
FOR
CONCATENATION
HIERARCHIES
J.-E.
PIN
.
431
PI-CALCULUS:
COMPLETE
PROOF
SYSTEMS
FOR
OBSERVATION
CONGRUENCES
IN
FINITE-CONTROL
TT
-
CALCULUS
H.
LIN
.
443
CONCURRENT
CONSTRAINTS
IN
THE
FUSION
CALCULUS
B.
VICTOR,
J.
PARROW
.
455
XIV
AUTOMATA
AND
BSP:
ON
COMPUTING
THE
ENTROPY
OF
CELLULAR
AUTOMATA
M.
D
'
AMICO,
G.
MANZINI,
L.
MARGARA
.
470
ON
THE
DETERMINIZATION
OF
WEIGHTED
FINITE
AUTOMATA
A.
L.
BUCHSBAUM,
R.
GIANCARLO,
J.
R.
WESTBROOK
.
482
BULK-SYNCHRONOUS
PARALLEL
MULTIPLICATION
OF
BOOLEAN
MATRICES
A.
TISKIN
.
494
REWRITING:
A
COMPLEX
EXAMPLE
OF
A
SIMPLIFYING
REWRITE
SYSTEM
H.
TOUZET
.
507
ON
A
DUALITY
BETWEEN
KRUSKAL
AND
DERSHOWITZ
THEOREMS
P.-A.
MELITES
.
518
A
TOTAL
AC-COMPATIBLE
REDUCTION
ORDERING
ON
HIGHER-ORDER
TERMS
D.
WALUKIEWICZ
.
530
INVITED
LECTURE:
MODEL
CHECKING
GAME
PROPERTIES
OF
MULTI-AGENT
SYSTEMS
T.
A.
HENZINGER
.
543
NETWORKS
AND
ROUTING:
LIMITED
WAVELENGTH
CONVERSION
IN
ALL-OPTICAL
TREE
NETWORKS
L.
GARGANO
.
544
COMPUTING
MIMICKING
NETWORKS
S.
CHAUDHURI,
K.
V.
SUBRAHMANYAM,
F.
WAGNER,
C.
D.
ZAROLIAGIS
.
556
REAL
TIME:
METRIC
SEMANTICS
FOR
TRUE
CONCURRENT
REAL
TIME
C.
BAIER,
J.-P.
KATOEN,
D.
LATELLA
.
568
THE
REGULAR
REAL-TIME
LANGUAGES
T.
A.
HENZINGER,
J.-F.
RASKIN,
P.-Y.
SCHOBBENS
.
580
NETWORKS
AND
ROUTING:
STATIC
AND
DYNAMIC
LOW-CONGESTED
INTERVAL
ROUTING
SCHEMES
S.
CICERONE,
G.
DI
STEFANO,
M.
FLAMMINI
.
592
LOW-BANDWIDTH
ROUTING
AND
ELECTRICAL
POWER
NETWORKS
D.
COOK,
V.
FABER,
M.
MARATHE,
A.
SRINIVASAN,
Y.
J.
SUSSMANN
.
604
AUTOMATA
AND
TEMPORAL
LOGIC:
CONSTRAINT
AUTOMATA
AND
THE
COMPLEXITY
OF
RECURSIVE
SUBTYPE
ENTAILMENT
F.
HENGLEIN,
J.
REHOF
.
616
REASONING
ABOUT
THE
PAST
WITH
TWO-WAY
AUTOMATA
M.
Y.
VARDI
.
628
XV
INVITED
LECTURE:
A
NEUROIDAL
ARCHITECTURE
FOR
COGNITIVE
COMPUTATION
L.
G.
VALIANT
.
642
APPROXIMATION:
DETERMINISTIC
POLYLOG
APPROXIMATION
FOR
MINIMUM
COMMUNICATION
SPANNING
TREES
D.
PELEG,
E.
RESHEF
.
670
A
POLYNOMIAL
TIME
APPROXIMATION
SCHEME
FOR
EUCLIDEAN
MINIMUM
COST
K-CONNECTIVITY
A.
CZUMAJ,
A.
LINGAS
.
682
PI-CALCULUS:
GLOBAL/LOCAL
SUBTYPING
AND
CAPABILITY
INFERENCE
FOR
A
DISTRIBUTED
7R-CALCULUS
P.
SEWELL
.
695
CHECKING
STRONG/WEAK
BISIMULATION
EQUIVALENCES
AND
OBSERVATION
CONGRUENCE
FOR
THE
TT
-
CALCULUS
Z.
LI,
H.
CHEN
.
707
ALGORITHMS:
INVERSION
OF
CIRCULANT
MATRICES
OVER
Z
M
D.
BINI,
G.
M.
DEL
CORSO,
G.
MANZINI,
L.
MARGARA
.
719
APPLICATION
OF
LEMPEL-ZIV
ENCODINGS
TO
THE
SOLUTION
OF
WORD
EQUATIONS
W.
PLANDOWSKI,
W.
RYTTER
.
731
THEOREM
PROVING:
EXPLICIT
SUBSTITUTIONS
FOR
CONSTRUCTIVE
NECESSITY
N.
GHANI,
V.
DE
PAIVA,
E.
RITTER
.
743
THE
RELEVANCE
OF
PROOF-IRRELEVANCE
G.
BARTHE
.
755
INVITED
LECTURE:
NEW
HORIZONS
IN
QUANTUM
INFORMATION
PROCESSING
G.
BRASSARD
.
769
ZERO-KNOWLEDGE
:
SEQUENTIAL
ITERATION
OF
INTERACTIVE
ARGUMENTS
AND
AN
EFFICIENT
ZERO-KNOWLEDGE
ARGUMENT
FOR
NP
I.
DAMGDRD,
B.
PFITZMANN
.
772
IMAGE
DENSITY
IS
COMPLETE
FOR
NON-INTERACTIVE-SZK
A.
DE
SANTIS,
G.
DI
CRESCENZO,
G.
PERSIANO,
M.
YUNG
.
784
SEMANTICS:
RANDOMNESS
SPACES
P.
BERTLING,
K.
WEIHRAUCH
.
796
XVI
TOTALITY,
DEFINABILITY
AND
BOOLEAN
CIRCUITS
A.
BUCCIARELLI,
I.
SALVO
.
808
QUANTUM
COMPUTING
AND
COMPUTATIONAL
BIOLOGY:
QUANTUM
COUNTING
G.
BRASSARD,
P.
H0YER,
A.
TAPP
.
820
ON
THE
COMPLEXITY
OF
DERIVING
SCORE
FUNCTIONS
FROM
EXAMPLES
FOR
PROBLEMS
IN
MOLECULAR
BIOLOGY
T.
AKUTSU,
M.
YAGIURA
.
832
PI-CALCULUS:
A
HIERARCHY
OF EQUIVALENCES
FOR
ASYNCHRONOUS
CALCULI
C.
FOURNET,
G.
GONTHIER
.
844
ON
ASYNCHRONY
IN
NAME-PASSING
CALCULI
M.
MERRO,
D.
SANGIORGI
.
856
INVITED
LECTURE:
PROTECTION
IN
PROGRAMMING-LANGUAGE
TRANSLATIONS
M.
ABADI
.
868
AUTOMATA:
EFFICIENT
SIMULATIONS
BY
QUEUE
MACHINES
H.
PETERSEN,
J.
M.
ROBSON
.
884
POWER
OF
COOPERATION
AND
MULTIHEAD
FINITE
SYSTEMS
P.
DURIS,
T.
JURDZINSKI,
M.
KUTYLOWSKI,
K.
LORYS
.
896
PROGRAMMING
LANGUAGES
AND
TYPES:
A
SIMPLE
SOLUTION
TO
TYPE
SPECIALIZATION
0.
DANVY
.
908
MULTI-STAGE
PROGRAMMING:
AXIOMATIZATION
AND
TYPE
SAFETY
W.
TAHA,
Z.-E.-A.
BENAISSA,
T.
SHEARD
.
918
AUTHOR
INDEX
.
931 |
any_adam_object | 1 |
author_GND | (DE-588)111582192X |
building | Verbundindex |
bvnumber | BV012057354 |
callnumber-first | Q - Science |
callnumber-label | QA267 |
callnumber-raw | QA267 |
callnumber-search | QA267 |
callnumber-sort | QA 3267 |
callnumber-subject | QA - Mathematics |
classification_rvk | ST 240 |
classification_tum | DAT 550f |
ctrlnum | (OCoLC)39714746 (DE-599)BVBBV012057354 |
dewey-full | 005.1 |
dewey-hundreds | 000 - Computer science, information, general works |
dewey-ones | 005 - Computer programming, programs, data, security |
dewey-raw | 005.1 |
dewey-search | 005.1 |
dewey-sort | 15.1 |
dewey-tens | 000 - Computer science, information, general works |
discipline | Informatik |
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">BV012057354</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20161012</controlfield><controlfield tag="007">t|</controlfield><controlfield tag="008">980707s1998 gw d||| |||| 10||| eng d</controlfield><datafield tag="016" ind1="7" ind2=" "><subfield code="a">953907864</subfield><subfield code="2">DE-101</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">3540647813</subfield><subfield code="9">3-540-64781-3</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)39714746</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV012057354</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">DE</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-739</subfield><subfield code="a">DE-384</subfield><subfield code="a">DE-91G</subfield><subfield code="a">DE-20</subfield><subfield code="a">DE-824</subfield><subfield code="a">DE-19</subfield><subfield code="a">DE-521</subfield><subfield code="a">DE-634</subfield><subfield code="a">DE-83</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">005.1</subfield><subfield code="2">21</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ST 240</subfield><subfield code="0">(DE-625)143625:</subfield><subfield code="2">rvk</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">25th international colloquium, ICALP '98, Aalborg, Denmark, July 13 - 17, 1998 ; proceedings</subfield><subfield code="c">Kim G. Larsen ... (eds.)</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Berlin [u.a.]</subfield><subfield code="b">Springer</subfield><subfield code="c">1998</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">XVI, 932 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">1443</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="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">automate</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">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">pi calcul</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">réécriture</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">sémantique</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">vérification</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Informatik</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Mathematik</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer science</subfield><subfield code="x">Mathematics</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=" " ind2="4"><subfield code="a">Programming languages (Electronic computers)</subfield><subfield code="v">Congresses</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="655" ind1=" " ind2="7"><subfield code="0">(DE-588)1071861417</subfield><subfield code="a">Konferenzschrift</subfield><subfield code="y">1998</subfield><subfield code="z">Ålborg</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="700" ind1="1" ind2=" "><subfield code="a">Larsen, Kim Guldstrand</subfield><subfield code="d">1957-</subfield><subfield code="e">Sonstige</subfield><subfield code="0">(DE-588)111582192X</subfield><subfield code="4">oth</subfield></datafield><datafield tag="711" ind1="2" ind2=" "><subfield code="a">ICALP</subfield><subfield code="n">25</subfield><subfield code="d">1998</subfield><subfield code="c">Ålborg</subfield><subfield code="j">Sonstige</subfield><subfield code="0">(DE-588)2170890-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">1443</subfield><subfield code="w">(DE-604)BV000000607</subfield><subfield code="9">1443</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=008160721&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-008160721</subfield></datafield></record></collection> |
genre | (DE-588)1071861417 Konferenzschrift 1998 Ålborg gnd-content |
genre_facet | Konferenzschrift 1998 Ålborg |
id | DE-604.BV012057354 |
illustrated | Illustrated |
indexdate | 2025-01-10T15:06:42Z |
institution | BVB |
institution_GND | (DE-588)2170890-3 |
isbn | 3540647813 |
language | English |
oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-008160721 |
oclc_num | 39714746 |
open_access_boolean | |
owner | DE-739 DE-384 DE-91G DE-BY-TUM DE-20 DE-824 DE-19 DE-BY-UBM DE-521 DE-634 DE-83 DE-188 DE-706 |
owner_facet | DE-739 DE-384 DE-91G DE-BY-TUM DE-20 DE-824 DE-19 DE-BY-UBM DE-521 DE-634 DE-83 DE-188 DE-706 |
physical | XVI, 932 S. graph. Darst. |
publishDate | 1998 |
publishDateSearch | 1998 |
publishDateSort | 1998 |
publisher | Springer |
record_format | marc |
series | Lecture notes in computer science |
series2 | Lecture notes in computer science |
spelling | Automata, languages and programming 25th international colloquium, ICALP '98, Aalborg, Denmark, July 13 - 17, 1998 ; proceedings Kim G. Larsen ... (eds.) Berlin [u.a.] Springer 1998 XVI, 932 S. graph. Darst. txt rdacontent n rdamedia nc rdacarrier Lecture notes in computer science 1443 Abstracte automaten gtt Automates mathématiques, Théorie des - Congrès Automates mathématiques, théorie des - Congrès ram Langages formels - Congrès Programmation (Informatique) - Congrès Programmeertalen gtt automate inriac complexité calcul inriac concurrence inriac langage formel inriac logique inriac pi calcul inriac réécriture inriac structure donnée inriac sémantique inriac vérification inriac Informatik Mathematik Computer science Mathematics Congresses Machine theory Congresses Programming languages (Electronic computers) Congresses Theoretische Informatik (DE-588)4196735-5 gnd rswk-swf (DE-588)1071861417 Konferenzschrift 1998 Ålborg gnd-content Theoretische Informatik (DE-588)4196735-5 s DE-604 Larsen, Kim Guldstrand 1957- Sonstige (DE-588)111582192X oth ICALP 25 1998 Ålborg Sonstige (DE-588)2170890-3 oth Lecture notes in computer science 1443 (DE-604)BV000000607 1443 DNB Datenaustausch application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=008160721&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis |
spellingShingle | Automata, languages and programming 25th international colloquium, ICALP '98, Aalborg, Denmark, July 13 - 17, 1998 ; 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 Programmation (Informatique) - Congrès Programmeertalen gtt automate inriac complexité calcul inriac concurrence inriac langage formel inriac logique inriac pi calcul inriac réécriture inriac structure donnée inriac sémantique inriac vérification inriac Informatik Mathematik Computer science Mathematics Congresses Machine theory Congresses Programming languages (Electronic computers) Congresses Theoretische Informatik (DE-588)4196735-5 gnd |
subject_GND | (DE-588)4196735-5 (DE-588)1071861417 |
title | Automata, languages and programming 25th international colloquium, ICALP '98, Aalborg, Denmark, July 13 - 17, 1998 ; proceedings |
title_auth | Automata, languages and programming 25th international colloquium, ICALP '98, Aalborg, Denmark, July 13 - 17, 1998 ; proceedings |
title_exact_search | Automata, languages and programming 25th international colloquium, ICALP '98, Aalborg, Denmark, July 13 - 17, 1998 ; proceedings |
title_full | Automata, languages and programming 25th international colloquium, ICALP '98, Aalborg, Denmark, July 13 - 17, 1998 ; proceedings Kim G. Larsen ... (eds.) |
title_fullStr | Automata, languages and programming 25th international colloquium, ICALP '98, Aalborg, Denmark, July 13 - 17, 1998 ; proceedings Kim G. Larsen ... (eds.) |
title_full_unstemmed | Automata, languages and programming 25th international colloquium, ICALP '98, Aalborg, Denmark, July 13 - 17, 1998 ; proceedings Kim G. Larsen ... (eds.) |
title_short | Automata, languages and programming |
title_sort | automata languages and programming 25th international colloquium icalp 98 aalborg denmark july 13 17 1998 proceedings |
title_sub | 25th international colloquium, ICALP '98, Aalborg, Denmark, July 13 - 17, 1998 ; 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 Programmation (Informatique) - Congrès Programmeertalen gtt automate inriac complexité calcul inriac concurrence inriac langage formel inriac logique inriac pi calcul inriac réécriture inriac structure donnée inriac sémantique inriac vérification inriac Informatik Mathematik Computer science Mathematics Congresses Machine theory Congresses Programming languages (Electronic computers) Congresses Theoretische Informatik (DE-588)4196735-5 gnd |
topic_facet | Abstracte automaten Automates mathématiques, Théorie des - Congrès Automates mathématiques, théorie des - Congrès Langages formels - Congrès Programmation (Informatique) - Congrès Programmeertalen automate complexité calcul concurrence langage formel logique pi calcul réécriture structure donnée sémantique vérification Informatik Mathematik Computer science Mathematics Congresses Machine theory Congresses Programming languages (Electronic computers) Congresses Theoretische Informatik Konferenzschrift 1998 Ålborg |
url | http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=008160721&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
volume_link | (DE-604)BV000000607 |
work_keys_str_mv | AT larsenkimguldstrand automatalanguagesandprogramming25thinternationalcolloquiumicalp98aalborgdenmarkjuly13171998proceedings AT icalpalborg automatalanguagesandprogramming25thinternationalcolloquiumicalp98aalborgdenmarkjuly13171998proceedings |