A New Normal-Form Theorem for Context-Free Phrase Structure Grammars
Journal of the ACM (JACM)
Journal of the ACM (JACM)
Journal of the ACM (JACM)
On the nonexistence of a phrase structure grammar for ALGOL 60
Communications of the ACM
The Mathematical Theory of Context-Free Languages
The Mathematical Theory of Context-Free Languages
Computational Linguistics
A formal model for context-free languages augmented with reduplication
Computational Linguistics
Datalog expressiveness of chain queries: grammar tools and characterizations
PODS '92 Proceedings of the eleventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Journal of the ACM (JACM)
A Grammatical Characterization of One-Way Nondeterministic Stack Languages
Journal of the ACM (JACM)
Stack Machines and Classes of Nonnested Macro Languages
Journal of the ACM (JACM)
Fixed Point Languages, Equality Languages, and Representation of Recursively Enumerable Languages
Journal of the ACM (JACM)
Security verification of programs with stack inspection
SACMAT '01 Proceedings of the sixth ACM symposium on Access control models and technologies
An efficient security verification method for programs with stack inspection
CCS '01 Proceedings of the 8th ACM conference on Computer and Communications Security
POPL '73 Proceedings of the 1st annual ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Counting with range concatenation grammars
Theoretical Computer Science - Algebraic methods in language processing
The Delta Operation: From Strings to Trees to Strings
Formal and Natural Computing - Essays Dedicated to Grzegorz Rozenberg [on occasion of his 60th birthday, March 14, 2002]
Strong Iteration Lemmata for Regular, Linear, Context-Free, and Linear Indexed Languages
FCT '99 Proceedings of the 12th International Symposium on Fundamentals of Computation Theory
The delta operation: from strings to trees to strings
Formal and natural computing
High level language oriented hardware and the post-von Neumann era
ISCA '78 Proceedings of the 5th annual symposium on Computer architecture
Degree-languages, polynomial time recognition, and the LBA problem
STOC '75 Proceedings of seventh annual ACM symposium on Theory of computing
Some restrictions on W-grammars
STOC '74 Proceedings of the sixth annual ACM symposium on Theory of computing
Tree-oriented proofs of some theorems on context-free and indexed languages
STOC '70 Proceedings of the second annual ACM symposium on Theory of computing
Translations on a context free grammar
STOC '69 Proceedings of the first annual ACM symposium on Theory of computing
Transformations and translations from the point of view of generalized finite automata theory
STOC '69 Proceedings of the first annual ACM symposium on Theory of computing
Journal of Automata, Languages and Combinatorics - Special issue: Selected papers of the workshop weighted automata: Theory and applications (Dresden University of Technology (Germany), March 4-8, 2002)
Parsing expression grammars: a recognition-based syntactic foundation
Proceedings of the 31st ACM SIGPLAN-SIGACT symposium on Principles of programming languages
On the mathematical properties of linguistic theories
Computational Linguistics - Special issue on mathematical properties of grammatical formalisms
English and the class of context-free languages
Computational Linguistics - Special issue on mathematical properties of grammatical formalisms
Chinese number-names, tree adjoining languages, and mild context-sensitivity
Computational Linguistics
Parsing some constrained grammar formalisms
Computational Linguistics
Contextual grammars as generative models of natural languages
Computational Linguistics
Computational complexity and lexical-functional grammar
Computational Linguistics
New frontiers beyond context-freeness: DI-grammars and DI-automata
EACL '93 Proceedings of the sixth conference on European chapter of the Association for Computational Linguistics
The use of shared forests in tree adjoining grammar parsing
EACL '93 Proceedings of the sixth conference on European chapter of the Association for Computational Linguistics
EACL '95 Proceedings of the seventh conference on European chapter of the Association for Computational Linguistics
A state-transition grammar for data-oriented parsing
EACL '95 Proceedings of the seventh conference on European chapter of the Association for Computational Linguistics
Chinese numbers, MIX, scrambling, and range concatenation grammars
EACL '99 Proceedings of the ninth conference on European chapter of the Association for Computational Linguistics
A tabular interpretation of a class of 2-Stack Automata
COLING '98 Proceedings of the 17th international conference on Computational linguistics - Volume 2
On the mathematical properties of linguistic theories
ACL '83 Proceedings of the 21st annual meeting on Association for Computational Linguistics
Multiset-valued linear index grammars: imposing dominance constraints on derivations
ACL '94 Proceedings of the 32nd annual meeting on Association for Computational Linguistics
ACL '88 Proceedings of the 26th annual meeting on Association for Computational Linguistics
Stochastic lexicalized tree-adjoining grammars
COLING '92 Proceedings of the 14th conference on Computational linguistics - Volume 2
Cross-serial dependencies are not hard to process
COLING '96 Proceedings of the 16th conference on Computational linguistics - Volume 1
On the construction of transition functions for DPLL(k) automata for syntactic pattern recognition
Machine Graphics & Vision International Journal
Information and Computation
Global Index Grammars and Descriptive Power
Journal of Logic, Language and Information
On the applicability of Global Index Grammars
ACL '03 Proceedings of the 41st Annual Meeting on Association for Computational Linguistics - Volume 2
Stochastic tree-adjoining grammars
HLT '91 Proceedings of the workshop on Speech and Natural Language
The generative capacity of block-synchronized context-free grammars
Theoretical Computer Science
Descriptional complexity of block-synchronization context-free grammars
Journal of Automata, Languages and Combinatorics - Special issue: Selected papers of the fourth international workshop on descriptional complexity of formal systems
Abstract Families of Abstract Categorial Languages
Electronic Notes in Theoretical Computer Science (ENTCS)
Model-Checking Games for Typed λ-Calculi
Electronic Notes in Theoretical Computer Science (ENTCS)
An infinite hierarchy induced by depth synchronization
Theoretical Computer Science
Synchronization functions of synchronized context-free grammars and languages
Journal of Automata, Languages and Combinatorics
Two complementary operations inspired by the DNA hairpin formation: Completion and reduction
Theoretical Computer Science
On the Generative Power of Multiple Context-Free Grammars and Macro Grammars
IEICE - Transactions on Information and Systems
On the synchronized derivation depth of context-free grammars
Theoretical Computer Science
Permutation Languages in Formal Linguistics
IWANN '09 Proceedings of the 10th International Work-Conference on Artificial Neural Networks: Part I: Bio-Inspired Systems: Computational and Ambient Intelligence
Phrase structure grammars and natural languages
IJCAI'83 Proceedings of the Eighth international joint conference on Artificial intelligence - Volume 1
On the growth of context-free languages
Journal of Automata, Languages and Combinatorics
Information and Computation
Checking automata and one-way stack languages
Journal of Computer and System Sciences
Two-way nested stack automata are equivalent to two-way stack automata
Journal of Computer and System Sciences
Un théorème de duplication pour les forêts algébriques
Journal of Computer and System Sciences
Journal of Computer and System Sciences
A generalized approach to formal languages
Journal of Computer and System Sciences
Generalized2 sequential machine maps
Journal of Computer and System Sciences
LR parsing for global index languages (GILs)
CIAA'03 Proceedings of the 8th international conference on Implementation and application of automata
TLCA'07 Proceedings of the 8th international conference on Typed lambda calculi and applications
Restarting tree automata and linear context-free tree languages
CAI'07 Proceedings of the 2nd international conference on Algebraic informatics
GIGs: restricted context-sensitive descriptive power in bounded polynomial-time
CICLing'03 Proceedings of the 4th international conference on Computational linguistics and intelligent text processing
Nodes connected by path languages
DLT'11 Proceedings of the 15th international conference on Developments in language theory
A sufficient condition for erasing productions to be avoidable
DLT'11 Proceedings of the 15th international conference on Developments in language theory
Gaining power by input operations: finite automata and beyond
CIAA'11 Proceedings of the 16th international conference on Implementation and application of automata
Formal language constrained reachability and model checking propositional dynamic logics
RP'11 Proceedings of the 5th international conference on Reachability problems
Iterated TGR languages: membership problem and effective closure properties
COCOON'06 Proceedings of the 12th annual international conference on Computing and Combinatorics
Safety is not a restriction at level 2 for string languages
FOSSACS'05 Proceedings of the 8th international conference on Foundations of Software Science and Computation Structures
How to build argumental graphs using TAG shared forest: a view from control verbs problematic
LACL'05 Proceedings of the 5th international conference on Logical Aspects of Computational Linguistics
DLT'04 Proceedings of the 8th international conference on Developments in Language Theory
CONCUR'06 Proceedings of the 17th international conference on Concurrency Theory
The Complexity of Verbal Languages over Groups
LICS '12 Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science
Algebraic synchronization trees and processes
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part II
Generalized derivations with synchronized context-free grammars
DLT'12 Proceedings of the 16th international conference on Developments in Language Theory
DLT'12 Proceedings of the 16th international conference on Developments in Language Theory
Simple models for recursive schemes
MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
An Efficient Parser for a Class of Contextual Languages
Fundamenta Informaticae
Sequences of level 1, 2, 3,..., k,...
CSR'07 Proceedings of the Second international conference on Computer Science: theory and applications
Hierarchies of infinite structures generated by pushdown automata and recursion schemes
MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
Recursive schemes, krivine machines, and collapsible pushdown automata
RP'12 Proceedings of the 6th international conference on Reachability Problems
The IO and OI hierarchies revisited
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part II
| Hi-index | 0.01 |
A new type of grammar for generating formal languages, called an indexed grammar, is presented. An indexed grammar is an extension of a context-free grammar, and the class of languages generated by indexed grammars has closure properties and decidability results similar to those for context-free languages. The class of languages generated by indexed grammars properly includes all context-free languages and is a proper subset of the class of context-sensitive languages. Several subclasses of indexed grammars generate interesting classes of languages.