Generic Results for Concatenation Hierarchies
Abstract
In the theory of formal languages, the understanding of concatenation hierarchies of regular languages is one of the most fundamental and challenging topic. In this paper, we survey progress made in the comprehension of this problem since 1971, and we establish new generic statements regarding this problem.
- Publication:
-
arXiv e-prints
- Pub Date:
- October 2017
- DOI:
- 10.48550/arXiv.1710.04313
- arXiv:
- arXiv:1710.04313
- Bibcode:
- 2017arXiv171004313P
- Keywords:
-
- Computer Science - Formal Languages and Automata Theory