Paper Info
Title
On finite-index indexed grammars and their restrictions
Abstract
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.
Year
DOI
Venue
2021
10.1016/j.ic.2020.104613
Information and Computation
Keywords
DocType
Volume
Indexed languages,Finite-index,Full trios,Semi-linearity,Bounded languages,ET0L languages
Journal
279
ISSN
Citations 
PageRank 
0890-5401
0
0.34
References 
Authors
0
3
Name
Order
Citations
PageRank
Flavio Dalessandro162.32
Oscar H. Ibarra201.35
Ian McQuillan39724.72