The study of finite automata and regular languages is a privileged meeting point of algebra and logic. Since the work of Büchi, regular languages have been classified according ...
cal Abstract Algebraic Logic: Leibniz Equality and Homomorphism Theorems George Voutsadakis Received: 24 May 2006 / Accepted: 28 August 2006 / Published online: 25 October 2006
Algebraic factorization is an extremely important part of any logic synthesis system but is computationally expensive. Hence it is important to look at parallel processing to spee...
In this paper we consider languages of labelled N-free posets over countable and scattered linear orderings. We prove that a language of such posets is series-rational if and only ...