Automata, Languages and Programming
Springer Berlin Heidelberg
Chapter title |
Satisfiability of systems of ordinal notations with the subterm property is decidable
|
---|---|
Chapter number | 155 |
Book title |
Automata, Languages and Programming
|
Published by |
Springer, Berlin, Heidelberg, July 1991
|
DOI | 10.1007/3-540-54233-7_155 |
Book ISBNs |
978-3-54-054233-9, 978-3-54-047516-3
|
Authors |
Jean-Pierre Jouannaud, Mitsuhiro Okada |
Country | Count | As % |
---|---|---|
United Kingdom | 1 | 25% |
Unknown | 3 | 75% |
Readers by professional status | Count | As % |
---|---|---|
Student > Ph. D. Student | 1 | 25% |
Professor > Associate Professor | 1 | 25% |
Student > Master | 1 | 25% |
Unknown | 1 | 25% |
Readers by discipline | Count | As % |
---|---|---|
Computer Science | 2 | 50% |
Philosophy | 1 | 25% |
Unknown | 1 | 25% |