A survey on difference hierarchies of regular languagesArticle
Authors: Olivier Carton ; Dominique Perrin ; Jean-Éric Pin
NULL##NULL##NULL
Olivier Carton;Dominique Perrin;Jean-Éric Pin
Difference hierarchies were originally introduced by Hausdorff and they play an important role in descriptive set theory. In this survey paper, we study difference hierarchies of regular languages. The first sections describe standard techniques on difference hierarchies, mostly due to Hausdorff. We illustrate these techniques by giving decidability results on the difference hierarchies based on shuffle ideals, strongly cyclic regular languages and the polynomial closure of group languages.
Volume: Volume 14, Issue 1
Published on: March 29, 2018
Accepted on: March 8, 2018
Submitted on: February 28, 2017
Keywords: Computer Science - Formal Languages and Automata Theory, 68Q70, 68Q45, 20M35
Funding:
Source : OpenAIRE Graph- Duality in Formal Languages and Logic - a unifying approach to complexity and semantics; Funder: European Commission; Code: 670624
- Challenges for Logic, Transducers and Automata; Funder: French National Research Agency (ANR); Code: ANR-16-CE40-0007