Abstract
Let A be a finite alphabet and let ∼ be a congruence on the free monoid A* induced by a set of partial commutations θ=θR ⊂ AxA. It has been shown that if w ε A* contains all letters of A then [w*]={u ε A* | u ∼ wn for some n ≥ 0} is a rational set iff the graph of the complement \(\overline \theta\) of θ is connected. We prove: 1) if θ is not connected then [w*] has starheight one, 2) if θ and \(\overline \theta\) are connected there exist words w ε A* such that [w*] is a rational set of arbitrary starheight.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
BERSTEL J., "Transductions and Context-Free languages", Teubner Verlag, 1979.
BRZOZOWSKI J.A. & R.S. COHEN, Properties of star-height, J. of Comput. Syst. Sci., 4, 1970, pp. 260–280.
COHEN R.S., StarHeight of Certain Families of Regular Events, J. of Comp. Syst. Sci., 4, 1970, pp. 281–297.
CHOFFRUT C., Free Partially Commutative Monoids, Research Report LITP 86-20, 1986.
CORI R. & Y. METIVIER, Recognizable subsets of some partially abelian monoids, Theoret. Comput. Sci., 35, 1985, pp. 179–190.
CORI R. & D. PERRIN, Automates et commutations partielles, RAIRO, Inform. Theor. 19, 1985, pp. 21–32.
DEJEAN F. & M.P. SCHUTZENBERGER, On a question of Eggan, Inform. Control, 9, 1966, pp. 23–25.
DUBOC C. "Commutations dans les monoides libres: un cadre théorique pour l'étude du parallélisme", Thèse de Doctorat, Université de Rouen, 1986.
DUBOC C., Some properties of commutation in free partially commutative monoids, Inform. Proc. Letters, 20, 1985, pp. 1–4.
DUBOC C., On some equations in free partially commutative monoids, Theoret. Comput. Sci., 46, 1986, pp. 159–174.
EGGAN L.C., Transition graphs and the star-height of regular events, Michigan Math. J., 10, 1963, pp. 385–395.
HASHIGUCHI K., Regular languages of Star Height One, Information and Control, 53, 1982, pp. 199–210.
LOTHAIRE, "Combinatorics on Words", Addison-Wesley, 1983.
MAZURKIEWIECZ A., "Concurrent program schemes and their interpretations", DAIMI Rep., PB-78, Aarhus University, 1977.
McNAUGHTON R., The Loop Complexity of Pure-Group Events, Inform. Control, 11, 1967, pp. 167–176.
METIVIER Y., Une condition suffisante de reconnaissabilité dans un monoide partiellement commutatif, RAIRO, Inform. Theor., 19, à paraître.
SALOMAA A., "Jewels of Formal Language Theory", Computer Science Press, 1980.
SENISCHE, On a property of the elements of n-colorable graphs, J. of Comb. Theory B, 16, 1974, pp. 191–193.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1987 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Choffrut, C., Duboc, C. (1987). A star-height problem in free monoids with partial commutations. In: Ottmann, T. (eds) Automata, Languages and Programming. ICALP 1987. Lecture Notes in Computer Science, vol 267. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-18088-5_15
Download citation
DOI: https://doi.org/10.1007/3-540-18088-5_15
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-18088-3
Online ISBN: 978-3-540-47747-1
eBook Packages: Springer Book Archive