Automatic Presentations of Structures
LCC '94 Selected Papers from the International Workshop on Logical and Computational Complexity
LICS '00 Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science
Automatic linear orders and trees
ACM Transactions on Computational Logic (TOCL)
Recurrent Reachability Analysis in Regular Model Checking
LPAR '08 Proceedings of the 15th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
The Isomorphism Problem on Classes of Automatic Structures
LICS '10 Proceedings of the 2010 25th Annual IEEE Symposium on Logic in Computer Science
Algorithmic metatheorems for decidable LTL model checking over infinite systems
FOSSACS'10 Proceedings of the 13th international conference on Foundations of Software Science and Computational Structures
| Hi-index | 0.00 |
It has been shown that every tree automatic structure admits an injective tree automatic presentation, but no good size or time bounds are known. From an arbitrary tree automatic presentation, we construct an equivalent injective one in polynomial space that consequently has exponential size. Furthermore we also prove an exponential lower bound for the size of injective tree automatic presentations.