License: Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.FSTTCS.2020.54
URN: urn:nbn:de:0030-drops-132952
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2020/13295/
Perrin, Dominique ;
Ryzhikov, Andrew
The Degree of a Finite Set of Words
Abstract
We generalize the notions of the degree and composition from uniquely decipherable codes to arbitrary finite sets of words. We prove that if X = Y∘Z is a composition of finite sets of words with Y complete, then d(X) = d(Y) ⋅ d(Z), where d(T) is the degree of T. We also show that a finite set is synchronizing if and only if its degree equals one.
This is done by considering, for an arbitrary finite set X of words, the transition monoid of an automaton recognizing X^* with multiplicities. We prove a number of results for such monoids, which generalize corresponding results for unambiguous monoids of relations.
BibTeX - Entry
@InProceedings{perrin_et_al:LIPIcs:2020:13295,
author = {Dominique Perrin and Andrew Ryzhikov},
title = {{The Degree of a Finite Set of Words}},
booktitle = {40th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2020)},
pages = {54:1--54:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-174-0},
ISSN = {1868-8969},
year = {2020},
volume = {182},
editor = {Nitin Saxena and Sunil Simon},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/opus/volltexte/2020/13295},
URN = {urn:nbn:de:0030-drops-132952},
doi = {10.4230/LIPIcs.FSTTCS.2020.54},
annote = {Keywords: synchronizing set, degree of a set, group of a set, monoid of relations}
}
Keywords: |
|
synchronizing set, degree of a set, group of a set, monoid of relations |
Collection: |
|
40th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2020) |
Issue Date: |
|
2020 |
Date of publication: |
|
04.12.2020 |