Nested Semantics over Finite Trees are Equationally Hard (Invited Talk)

Luca Aceto

Publikation: Bidrag til bog/antologi/rapport/konference proceeding › Konferenceartikel i proceeding › Forskning

Originalsprog	Engelsk
Titel	Proceedings of EXPRESS'03 : Electronic Notes in Theoretical Computer Science
Redaktører	F Corradini, U Nestmann
Antal sider	2
Forlag	Pergamon Press
Publikationsdato	2003
Udgave	96
Sider	5-6
Status	Udgivet - 2003
Begivenhed	Nested Semantics over Finite Trees are Equationally Hard (Invited Talk) - Marseille, Frankrig Varighed: 2 sep. 2003 → 2 sep. 2003 Konferencens nummer: 10

Konference	Nested Semantics over Finite Trees are Equationally Hard (Invited Talk)
Nummer	10
Land/Område	Frankrig
By	Marseille
Periode	02/09/2003 → 02/09/2003

AUB Link

@inproceedings{f402b6e0003b11dab4d5000ea68e967b,

title = "Nested Semantics over Finite Trees are Equationally Hard (Invited Talk)",

author = "Luca Aceto",

year = "2003",

language = "English",

pages = "5--6",

editor = "F Corradini and U Nestmann",

booktitle = "Proceedings of EXPRESS'03",

publisher = "Pergamon Press",

edition = "96",

note = "Nested Semantics over Finite Trees are Equationally Hard (Invited Talk) ; Conference date: 02-09-2003 Through 02-09-2003",

}

TY - GEN

T1 - Nested Semantics over Finite Trees are Equationally Hard (Invited Talk)

AU - Aceto, Luca

N1 - Conference code: 10

PY - 2003

Y1 - 2003

M3 - Article in proceeding

SP - 5

EP - 6

BT - Proceedings of EXPRESS'03

A2 - Corradini, F

A2 - Nestmann, U

PB - Pergamon Press

T2 - Nested Semantics over Finite Trees are Equationally Hard (Invited Talk)

Y2 - 2 September 2003 through 2 September 2003

ER -