2000 character limit reached
Congruence based proofs of the recognizability theorems for free many-sorted algebras
Published 24 Aug 2018 in cs.FL | (1808.08217v1)
Abstract: We generalize several recognizability theorems for free single-sorted algebras to the field of many-sorted algebras and provide, in a uniform way and without using neither regular tree grammars nor tree automata, purely algebraic proofs of them based on the concept of congruence.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.