Size and computation of injective tree automatic presentations

DOI10.1007/978-3-642-22993-0_39MaRDI QIDQ3088059zbMATH OpenOpenAlexFDO

Authors Thomas Weidner, Dietrich Kuske

Publication date 17 August 2011

Published in Mathematical Foundations of Computer Science 2011 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-22993-0_39

Mathematics Subject Classification ID

Computable structure theory, computable model theory (03C57) Automata and formal grammars in connection with logical questions (03D05)

Recommendations

• Automatic structures of bounded degree revisited
• Automatic Structures: Richness and Limitations
• AUTOMATIC AND POLYNOMIAL-TIME ALGEBRAIC STRUCTURES
• Automatic Structures of Bounded Degree Revisited
• Automata Presenting Structures: A Survey of the Finite String Case

Cited in

(2)

• Tree-automatic scattered linear orders
• AUTOMATIC AND POLYNOMIAL-TIME ALGEBRAIC STRUCTURES

This page was built for publication: Size and computation of injective tree automatic presentations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3088059)