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

研究成果: Conference contribution

本文言語	English
ホスト出版物のタイトル	Automata, Languages and Programming - 18th International Colloquium, Proceedings
編集者	Javier Leach Albert, Mario Rodriguez Artalejo, Burkhard Monien
出版社	Springer Verlag
ページ	455-468
ページ数	14
ISBN（印刷版）	9783540542339
DOI	https://doi.org/10.1007/3-540-54233-7_155
出版ステータス	Published - 1991
外部発表	はい
イベント	18th International Colloqulum on Automata, Languages, and Programming, ICALP 1991 - Madrid, Spain 継続期間: 1991 7月 8 → 1991 7月 12

出版物シリーズ

名前	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
巻	510 LNCS
ISSN（印刷版）	0302-9743
ISSN（電子版）	1611-3349

Other

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

ASJC Scopus subject areas

理論的コンピュータサイエンス
コンピュータサイエンス（全般）

文献へのアクセス

10.1007/3-540-54233-7_155

他のファイルとリンク

引用スタイル

Jouannaud, J. P., & Okada, M. (1991). Satisfiability of systems of ordinal notations with the subterm property is decidable. In J. L. Albert, M. R. Artalejo, & B. Monien (Eds.), Automata, Languages and Programming - 18th International Colloquium, Proceedings (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. ed. / Javier Leach Albert; Mario Rodriguez Artalejo; Burkhard Monien. 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).

研究成果: Conference contribution

Jouannaud, JP & Okada, M 1991, Satisfiability of systems of ordinal notations with the subterm property is decidable. in JL Albert, MR Artalejo & B Monien (eds), Automata, Languages and Programming - 18th International Colloquium, Proceedings. 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 Albert JL, Artalejo MR, Monien B, editors, Automata, Languages and Programming - 18th International Colloquium, Proceedings. 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. editor / Javier Leach Albert ; Mario Rodriguez Artalejo ; Burkhard Monien. 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",

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

publisher = "Springer Verlag",

pages = "455--468",

editor = "Albert, {Javier Leach} and Artalejo, {Mario Rodriguez} and Burkhard Monien",

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

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

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

A2 - Albert, Javier Leach

A2 - Artalejo, Mario Rodriguez

A2 - Monien, Burkhard

PB - Springer Verlag

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

Y2 - 8 July 1991 through 12 July 1991

ER -