A survey on the local divisor technique
journal contributionposted on 2018-02-23, 09:35 authored by Volker Diekert, Manfred Kufleitner
© 2015 Elsevier B.V. Local divisors allow a powerful induction scheme on the size of a monoid. We survey this technique by giving several examples of this proof method. These applications include linear temporal logic, rational expressions with Kleene stars restricted to prefix codes with bounded synchronization delay, Church-Rosser congruential languages, and Simon's Factorization Forest Theorem. We also introduce the notion of a localizable language class as a new abstract concept which unifies some of the proofs for the results above.
M.K. was supported by the German Research Foundation (DFG) grant DI 435/5-2.
- Computer Science
Published inTheoretical Computer Science
CitationDIEKERT, V. and KUFLEITNER, M., 2014. A survey on the local divisor technique. Theoretical Computer Science, 610(Pt A), pp. 13-23.
- AM (Accepted Manuscript)
Publisher statementThis work is made available according to the conditions of the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0) licence. Full details of this licence are available at: https://creativecommons.org/licenses/by-nc-nd/4.0/
NotesThis paper was accepted for publication in the journal Theoretical Computer Science and the definitive published version is available at https://doi.org/10.1016/j.tcs.2015.07.008