On recognizable languages in divisibility monoids
Kleene’s theorem on recognizable languages in free monoids is considered to be of eminent importance in theoretical computer science. It has been generalized into various directions, including trace and rational monoids. Here, we investigate divisibility monoids which are defined by and capture algebraic properties sufficient to obtain a characterization of the recognizable languages by certain rational expressions as known from trace theory. The proofs rely on Ramsey’s theorem, distributive lattice theory and on Hashigushi’s rank function generalized to our divisibility monoids. We obtain Ochma’nski’s theorem on recognizable languages in free partially commutative monoids as a consequence.
KeywordsDistributive Lattice Closure Property Label Sequence Irreducible Element Free Monoid
Unable to display preview. Download preview PDF.
- 3.G. Birkhoff. Lattice Theory. Colloquium Publications vol. 25. American Mathematical Society, Providence, 1940; third edition, seventh printing from 1993.Google Scholar
- 4.G. Boudol. Computational semantics of term rewriting. In M. Nivat and J.C. Reynolds, editors, Algebraic Methods in Semantics, pages 169–236. Cambridge University Press, 1985.Google Scholar
- 5.J.R. Büchi. On a decision method in restricted second order arithmetics. In E. Nagel et al., editor, Proc. Intern. Congress on Logic, Methodology and Philosophy of Science, pages 1–11. Stanford University Press, Stanford, 1960.Google Scholar
- 6.V. Diekert and Y. Mètivier. Partial commutation and traces. In G. Rozenberg and A. Salomaa, editors, Handbook of Formal Languages, volume 3. Springer, 1997.Google Scholar
- 7.V. Diekert and G. Rozenberg. The Book of Traces. World Scientific Publ. Co., 1995.Google Scholar
- 9.M. Droste and D. Kuske. On recognizable languages in left divisibility monoids. Technical Report MATH-AL-9-1998, TU Dresden, 1998.Google Scholar
- 10.C. Duboc. Commutations dans les monoïdes libres: un cadre thèorique pour l’ètude du parallelisme. Thèse, Facultè des Sciences de l’Universitè de Rouen, 1986.Google Scholar
- 12.D. Kuske. On rational and on left divisibility monoids. Technical Report MATHAL-3-1999, TU Dresden, 1999.Google Scholar
- 13.E. Ochmański. Regular behaviour of concurrent systems. Bull. Europ. Assoc. for Theor. Comp. Science, 27:56–67, 1985.Google Scholar
- 14.P. Panangaden and E.W. Stark. Computations, residuals and the power of indeterminacy. In Automata, Languages and Programming, Lecture Notes in Comp. Science vol. 317, pages 439–454. Springer, 1988.Google Scholar
- 19.G. Winskel. Event structures. In W. Brauer, W. Reisig, and G. Rozenberg, editors, Petri nets: Applications and Relationships to Other Models of Concurrency, Lecture Notes in Comp. Science vol. 255, pages 325–392. Springer, 1987.Google Scholar