Finite Presentations of Infinite Structures: Automata and Interpretations

• 13 September 2004
• journal article
• research article
• Published by Springer Nature in Theory of Computing Systems
• Vol. 37  (6) , 641-674
• https://doi.org/10.1007/s00224-004-1133-y

Abstract

Keywords

• COMPUTATIONAL MATHEMATIC
• MODEL CHECK
• BINARY TREE
• EQUAL LENGTH
• ALGORITHMIC ISSUE