Skip to search formSkip to main contentSkip to account menu

Indexed language

Known as: Macro grammar 
Indexed languages are a class of formal languages discovered by Alfred Aho; they are described by indexed grammars and can be recognized by nested… 
Wikipedia (opens in a new tab)

Related topics

Related topics

12 relations
Abstract family of languagesChomsky hierarchyCombinatory categorial grammarContext-free language

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2010
2010
A NOVEL APPROACH TO REDUCE COMPUTATIONAL COMPLEXITY OF MULTIPLE DICTIONARY LEMPEL ZIV WELCH MDLZW USING INDEXED K NEAREST TWIN NEIGHBOR IKNTN CLUSTERING AND BINARY INSERTION SORT ALGORITHMS
2009
2009
A Succinct N-gram Language Model
Efficient processing of tera-scale text data is an important research topic. This paper proposes lossless compression of N-gram… 
2009
2009
A linear time extension of deterministic pushdown automata
A linear time extension of deterministic pushdown automata is introduced that recognizes all deterministic context-free languages… 
2005
2005
Underspecified Interpretations in a Curry-typed Representation Language
In previous work we have developed Property Theory with Curry Typing (PTCT, an intensional first-order logic for natural language… 
2005
2005
The generative capacity of block-synchronized context-free grammars
2001
2001
Improving Performance of Large Physically Indexed Caches by Decoupling Memory Addresses from Cache Addresses
Modern CPUs often use large physically indexed caches that are direct-mapped or have low associativities. Such caches do not… 
Review
1998
Review
1998
Javabeans by Example
1. How to Use This Book. Introduction. The Chili Pepper Story. The Structure of the Book. 2. Introducing Beans. Definition-What… 
1993
1993
Neuroanatomy and the Neurologic Exam: A Thesaurus of Synonyms, Similar-Sounding Non-Synonyms, and Terms of Variable Meaning
Instructions for Use. Description of Indexed Sections. Methods. Non-Synonyms (Similar-Sounding). General Synonyms. Specific… 
1990
1990
Propagating Epistemic Coordination Through Mutual Defaults I
A mutual default is a rule, capable of tolerating exceptions, that is mutually supposed by a group G: i.e., the rule is supposed… 
1986
1986
Self-Embedding Indexed Grammars
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)