Generic Results for Concatenation Hierarchies
classification
💻 cs.FL
keywords
concatenationgenerichierarchieslanguagesproblemchallengingcomprehensionestablish
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.