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 ...
We present a Language Prototyping System that facilitates the modular development of interpreters from semantic specifications. The theoretical basis of our system is the integrat...
Motivated by applications in software verification, we explore automated reasoning about the non-disjoint combination of theories of infinitely many finite structures, where the...
A well-known result due to J. T. Stafford asserts that a stably free left module M over the Weyl algebras D = An(k) or Bn(k) − where k is a field of characteristic 0 − with ...