Abstract
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. © 2011 Springer-Verlag GmbH.
Cite
CITATION STYLE
Kuske, D., & Weidner, T. (2011). Size and computation of injective tree automatic presentations. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6907 LNCS, pp. 424–435). https://doi.org/10.1007/978-3-642-22993-0_39
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
