Published January 1, 2017
| Version v1
Conference paper
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 properties, their relationships, and their decidability properties.
Files
bib-40c236a8-463c-4c4d-9878-ab8984c1fa15.txt
Files
(167 Bytes)
| Name | Size | Download all |
|---|---|---|
|
md5:e879f64037436e8b2fb68b213cc41be4
|
167 Bytes | Preview Download |