Contextual partial commutations
| Autor: | Robert Mercaş, Christian Choffrut |
|---|---|
| Přispěvatelé: | Laboratoire d'informatique Algorithmique : Fondements et Applications (LIAFA), Université Paris Diderot - Paris 7 (UPD7)-Centre National de la Recherche Scientifique (CNRS), Research Group on Mathematical Linguistics (GRLMC), Universitat Rovira i Virgili, Departament de Filologies Romàniques [Tarragona] |
| Jazyk: | angličtina |
| Rok vydání: | 2010 |
| Předmět: |
Factor-critical graph
Monoid Discrete mathematics General Computer Science [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM] 16. Peace & justice Lexicographical order Contextual trace monoids Theoretical Computer Science Combinatorics [INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM] Conjugacy class Circulant graph Free monoid Discrete Mathematics and Combinatorics Feedback vertex set partial commutations Complement graph Mathematics |
| Zdroj: | Discrete Mathematics and Theoretical Computer Science Discrete Mathematics and Theoretical Computer Science, DMTCS, 2010, 12 (4), pp.59-72 ResearcherID |
| ISSN: | 1462-7264 1365-8050 |
| Popis: | special issue dedicated to the second edition of the conference AutoMathA: from Mathematics to Applications We consider the monoid T with the presentation < a, b; aab = aba > which is ''close'' to trace monoids. We prove two different types of results. First, we give a combinatorial description of the lexicographically minimum and maximum representatives of their congruence classes in the free monoid \a, b\* and solve the classical equations, such as commutation and conjugacy in T. Then we study the closure properties of the two subfamilies of the rational subsets of T whose lexicographically minimum and maximum cross-sections respectively, are rational in \a, b\*. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|