Abstract. We show that some language theoretic and logical characterizations of recognizable word languages whose syntactic monoid is in the variety DA also hold over traces. To th...
Let be an alphabet of size t, let f : be a non-erasing morphism, let w be an infinite fixed point of f, and let E(w) be the critical exponent of w. We prove that if E(w) is fi...
We investigate factorizations of regular languages in terms of prime languages. A language is said to be strongly prime decomposable if any way of factorizing the language yields a...
ract State Machines Be Useful in Language Theory? Yuri Gurevich a Margus Veanes a Charles Wallace b aMicrosoft Research, Redmond, Washington, USA bMichigan Tech, Houghton, Michigan...
Bag context is a device for regulated rewriting in tree and string grammars. It represents context that is not part of the developing tree or string, but evolves on its own during ...
Frank Drewes, Christine du Toit, Sigrid Ewert, Bri...