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 properties, their relationships, and their decidability properties.
Year
DOI
Venue
2017
10.1007/978-3-319-53733-7_21
Lecture Notes in Computer Science
Keywords
DocType
Volume
Indexed languages,Finite-index,Full trios,Semi-linearity,Bounded languages,ET0L languages
Conference
10168
ISSN
Citations 
PageRank 
0302-9743
2
0.41
References 
Authors
6
3
Name
Order
Citations
PageRank
Flavio D’Alessandro182.26
Oscar H. Ibarra23235741.44
Ian McQuillan39724.72