Satisfiability of systems of ordinal notations with the subterm property is decidable

Jean Pierre Jouannaud; Mitsuhiro Okada

doi:10.1007/3-540-54233-7_155

Satisfiability of systems of ordinal notations with the subterm property is decidable

Jean Pierre Jouannaud, Mitsuhiro Okada

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Original language	English
Title of host publication	Automata, Languages and Programming - 18th International Colloquium, Proceedings
Publisher	Springer Verlag
Pages	455-468
Number of pages	14
Volume	510 LNCS
ISBN (Print)	9783540542339
DOIs	https://doi.org/10.1007/3-540-54233-7_155
Publication status	Published - 1991
Externally published	Yes
Event	18th International Colloqulum on Automata, Languages, and Programming, ICALP 1991 - Madrid, Spain Duration: 1991 Jul 8 → 1991 Jul 12

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	510 LNCS
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Other

Other	18th International Colloqulum on Automata, Languages, and Programming, ICALP 1991
Country/Territory	Spain
City	Madrid
Period	91/7/8 → 91/7/12

ASJC Scopus subject areas

Theoretical Computer Science
Computer Science(all)

Access to Document

10.1007/3-540-54233-7_155

Cite this

Jouannaud, J. P., & Okada, M. (1991). Satisfiability of systems of ordinal notations with the subterm property is decidable. In Automata, Languages and Programming - 18th International Colloquium, Proceedings (Vol. 510 LNCS, pp. 455-468). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 510 LNCS). Springer Verlag. https://doi.org/10.1007/3-540-54233-7_155

Satisfiability of systems of ordinal notations with the subterm property is decidable. / Jouannaud, Jean Pierre; Okada, Mitsuhiro.

Automata, Languages and Programming - 18th International Colloquium, Proceedings. Vol. 510 LNCS Springer Verlag, 1991. p. 455-468 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 510 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Jouannaud, JP & Okada, M 1991, Satisfiability of systems of ordinal notations with the subterm property is decidable. in Automata, Languages and Programming - 18th International Colloquium, Proceedings. vol. 510 LNCS, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 510 LNCS, Springer Verlag, pp. 455-468, 18th International Colloqulum on Automata, Languages, and Programming, ICALP 1991, Madrid, Spain, 91/7/8. https://doi.org/10.1007/3-540-54233-7_155

Jouannaud JP, Okada M. Satisfiability of systems of ordinal notations with the subterm property is decidable. In Automata, Languages and Programming - 18th International Colloquium, Proceedings. Vol. 510 LNCS. Springer Verlag. 1991. p. 455-468. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/3-540-54233-7_155

Jouannaud, Jean Pierre ; Okada, Mitsuhiro. / Satisfiability of systems of ordinal notations with the subterm property is decidable. Automata, Languages and Programming - 18th International Colloquium, Proceedings. Vol. 510 LNCS Springer Verlag, 1991. pp. 455-468 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{d76abf8f6e8a4953b996637b8e71719e,

title = "Satisfiability of systems of ordinal notations with the subterm property is decidable",

author = "Jouannaud, {Jean Pierre} and Mitsuhiro Okada",

year = "1991",

doi = "10.1007/3-540-54233-7_155",

language = "English",

isbn = "9783540542339",

volume = "510 LNCS",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "455--468",

booktitle = "Automata, Languages and Programming - 18th International Colloquium, Proceedings",

address = "Germany",

note = "18th International Colloqulum on Automata, Languages, and Programming, ICALP 1991 ; Conference date: 08-07-1991 Through 12-07-1991",

}

TY - GEN

T1 - Satisfiability of systems of ordinal notations with the subterm property is decidable

AU - Jouannaud, Jean Pierre

AU - Okada, Mitsuhiro

PY - 1991

Y1 - 1991

UR - http://www.scopus.com/inward/record.url?scp=85030841054&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85030841054&partnerID=8YFLogxK

U2 - 10.1007/3-540-54233-7_155

DO - 10.1007/3-540-54233-7_155

M3 - Conference contribution

AN - SCOPUS:85030841054

SN - 9783540542339

VL - 510 LNCS

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 455

EP - 468

BT - Automata, Languages and Programming - 18th International Colloquium, Proceedings

PB - Springer Verlag

T2 - 18th International Colloqulum on Automata, Languages, and Programming, ICALP 1991

Y2 - 8 July 1991 through 12 July 1991

ER -

Satisfiability of systems of ordinal notations with the subterm property is decidable

Publication series

Other

ASJC Scopus subject areas

Access to Document

Other files and links

Cite this