Counting with range concatenation grammars

DOI10.1016/S0304-3975(01)00353-XMaRDI QIDQ1870577zbMATH OpenFDO

Authors Pierre Boullier

Publication date 14 May 2003

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0304-3975(01)00353-X

zbMATH Keywords

context-sensitive parsingformal powergrammar formalismsgrammar modularityparse time complexityshared forests

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Recommendations

• From contextual grammars to range concatenation grammars
• Context-free commutative grammars with integer counters and resets
• scientific article; zbMATH DE number 4033108
• On counting functions of languages
• Regular Expressions with Numerical Constraints and Automata with Counters
• Array grammars with contextual operations
• Publication:4886090
• scientific article; zbMATH DE number 1406153
• Context-free grammars, generating functions and combinatorial arrays

Cites work

• Counting with range concatenation grammars
• scientific article; zbMATH DE number 718142 (Why is no real title available?)
• Indexed Grammars—An Extension of Context-Free Grammars
• On derivation trees of indexed grammars - an extension of the uvwxy- theorem

Cited in

(6)

• Global index grammars and descriptive power
• Counting with range concatenation grammars
• On the Relation between Multicomponent Tree Adjoining Grammars with Tree Tuples (TT-MCTAG) and Range Concatenation Grammars (RCG)
• From contextual grammars to range concatenation grammars
• Logical Aspects of Computational Linguistics
• TuLiPA -- parsing extensions of TAG with range concatenation grammars

This page was built for publication: Counting with range concatenation grammars

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1870577)