科研之友
微信
新浪微博
Facebook
分享链接
摘要
We present a framework for the composition of overlapping objects based on semigroup theory. To do so, we develop a language theory of (labelled) birooted trees, that is, subsets of (extension of) free inverse monoids. In the underlying setting of partial algebras, we define a suitable notion of a syntactic congruence such that (i) having a syntactic congruence of finite index captures -definability; (ii) a certain order-bisimulation refinement of the syntactic congruence captures (so called) quasi-recognisability in the same way.
- 出版日期2015-12
