Well-Quasi-Ordering Hereditarily Finite Sets

Alberto Policriti, Alexandru I. Tomescu

Research output: Chapter in Book/Report/Conference proceedingConference contributionScientificpeer-review

Original languageEnglish
Title of host publicationLanguage and Automata Theory and Applications (LATA)
EditorsAH Dediu, S Inenaga, C MartinVide
Number of pages12
PublisherSpringer-Verlag
Publication date2011
Pages440-451
ISBN (Print)978-3-642-21253-6
ISBN (Electronic)978-3-642-21254-3
DOIs
Publication statusPublished - 2011
Externally publishedYes
MoE publication typeA4 Article in conference proceedings
EventInternational Conference, LATA 2011 - Tarragona, Spain
Duration: 26 May 201130 May 2011
Conference number: 5

Publication series

NameLecture Notes in Computer Science
PublisherSpringer
Volume6638

Cite this

Policriti, A., & Tomescu, A. I. (2011). Well-Quasi-Ordering Hereditarily Finite Sets. In AH. Dediu, S. Inenaga, & C. MartinVide (Eds.), Language and Automata Theory and Applications (LATA) (pp. 440-451). (Lecture Notes in Computer Science; Vol. 6638). Springer-Verlag. https://doi.org/10.1007/978-3-642-21254-3_35
Policriti, Alberto ; Tomescu, Alexandru I. / Well-Quasi-Ordering Hereditarily Finite Sets. Language and Automata Theory and Applications (LATA). editor / AH Dediu ; S Inenaga ; C MartinVide. Springer-Verlag, 2011. pp. 440-451 (Lecture Notes in Computer Science).
@inproceedings{80a692dbc8d94af18c3bc04c3099c2c0,
title = "Well-Quasi-Ordering Hereditarily Finite Sets",
author = "Alberto Policriti and Tomescu, {Alexandru I.}",
note = "Volume: Proceeding volume:",
year = "2011",
doi = "10.1007/978-3-642-21254-3_35",
language = "English",
isbn = "978-3-642-21253-6",
series = "Lecture Notes in Computer Science",
publisher = "Springer-Verlag",
pages = "440--451",
editor = "AH Dediu and S Inenaga and C MartinVide",
booktitle = "Language and Automata Theory and Applications (LATA)",
address = "Germany",

}

Policriti, A & Tomescu, AI 2011, Well-Quasi-Ordering Hereditarily Finite Sets. in AH Dediu, S Inenaga & C MartinVide (eds), Language and Automata Theory and Applications (LATA). Lecture Notes in Computer Science, vol. 6638, Springer-Verlag, pp. 440-451, International Conference, LATA 2011, Tarragona, Spain, 26/05/2011. https://doi.org/10.1007/978-3-642-21254-3_35

Well-Quasi-Ordering Hereditarily Finite Sets. / Policriti, Alberto; Tomescu, Alexandru I.

Language and Automata Theory and Applications (LATA). ed. / AH Dediu; S Inenaga; C MartinVide. Springer-Verlag, 2011. p. 440-451 (Lecture Notes in Computer Science; Vol. 6638).

Research output: Chapter in Book/Report/Conference proceedingConference contributionScientificpeer-review

TY - GEN

T1 - Well-Quasi-Ordering Hereditarily Finite Sets

AU - Policriti, Alberto

AU - Tomescu, Alexandru I.

N1 - Volume: Proceeding volume:

PY - 2011

Y1 - 2011

U2 - 10.1007/978-3-642-21254-3_35

DO - 10.1007/978-3-642-21254-3_35

M3 - Conference contribution

SN - 978-3-642-21253-6

T3 - Lecture Notes in Computer Science

SP - 440

EP - 451

BT - Language and Automata Theory and Applications (LATA)

A2 - Dediu, AH

A2 - Inenaga, S

A2 - MartinVide, C

PB - Springer-Verlag

ER -

Policriti A, Tomescu AI. Well-Quasi-Ordering Hereditarily Finite Sets. In Dediu AH, Inenaga S, MartinVide C, editors, Language and Automata Theory and Applications (LATA). Springer-Verlag. 2011. p. 440-451. (Lecture Notes in Computer Science). https://doi.org/10.1007/978-3-642-21254-3_35