Published January 1, 2021
| Version v1
Journal article
Open
On finite-index indexed grammars and their restrictions
- 1. Univ Calif Santa Barbara, Dept Comp Sci, Santa Barbara, CA 93106 USA
- 2. Univ Saskatchewan, Dept Comp Sci, Saskatoon, SK S7N 5A9, Canada
Description
The family, L(INDLIN), of languages generated by linear indexed grammars has been studied in the literature. It is known that the Parikh image of every language in L(INDLIN) is semi-linear. However, there are bounded semi-linear languages that are not in L(INDLIN). Here, we look at larger families of (restricted) indexed languages and study their combinatorial and decidability properties, and their relationships. (C) 2020 Elsevier Inc. All rights reserved.
Files
bib-f846ae99-6ba5-431e-bb15-02e8d164d85e.txt
Files
(149 Bytes)
| Name | Size | Download all |
|---|---|---|
|
md5:a5a038e48038016988c1c923333b97ab
|
149 Bytes | Preview Download |