A New Normal-Form Theorem for Context-Free Phrase Structure Grammars

Cited in

(69)

Constructing a realtime deterministic pushdown automaton from a grammar
Restrictions on NLC graph grammars
Gaifman's theorem on categorial grammars revisited
A method for transforming grammars into LL(k) form
Position-restricted grammar forms and grammars
On LLP(k) grammars and languages
An elementary proof of double Greibach normal form
Transductions des langages de Chomsky
On the pre-AFL of \([lg\;n]\) space and related families of languages
Normal forms of deterministic grammars
Control sets on context-free grammar forms
On equivalence of grammars through transformation trees
Monadic recursion schemes: The effect of constants
Context-free graph languages of bounded degree are generated by apex graph grammars
Double Greibach operator grammars
Knapsack in graph groups
Generalizing input-driven languages: theoretical and practical benefits
Hardest languages for conjunctive and Boolean grammars
Algebraically complete semirings and Greibach normal form
Greibach normal form transformation revisited.
The multiplicative-additive Lambek calculus with subexponential and bracket modalities
Generating context-free languages using spiking neural P systems with structural plasticity
Deontology of compound actions
Categorial dependency grammars
Model checking propositional dynamic logic with all extras
Properties of syntax directed translations
Principal AFL
Time-bounded grammars and their languages
On stochastic context-free languages
Substitution expressions
A homomorphism theorem for weighted context-free grammars
Recursive descent parsing for Boolean grammars
Greibach normal form for \(\omega\)-algebraic systems and weighted simple \(\omega\)-pushdown automata
A computation model with automatic functions and relations as primitive operations
A pumping lemma for flip-pushdown languages
String analysis as an abstract interpretation
Normal forms for multiple context-free languages and displacement Lambek grammars
Identification in the Limit of k,l-Substitutable Context-Free Languages
Conjunctive Grammars with Restricted Disjunction
Conjunctive and Boolean grammars: the true general case of the context-free grammars
Stochastic grammars and languages
Complexity of the infinitary Lambek calculus with Kleene star
Greibach normal form transformation, revisited
A Greibach normal form for context-free graph grammars
SOME DECISION QUESTIONS CONCERNING THE TIME COMPLEXITY OF LANGUAGE ACCEPTORS
Characterization of context-free languages
Extended Lambek calculi and first-order linear logic
Control sets on grammars
The theory of languages
The theory of languages
A modification of a substitution theorem and some necessary and sufficient conditions for sets to be context-free
A note on left-recursive rules and the partitioning of a recognition matrix for syntax-directed translation
The hardest language for conjunctive grammars
Simple matrix grammars and their leftmost variants
Normal form algorithms for extended context-free grammars
One-Way Restarting Automata and Their Sensitivitys
A survey on automata with translucent letters
Polymorphic higher-order context-free session types
Immunity and pseudorandomness of context-free languages
Subtyping context-free session types
Weighted basic parallel processes and combinatorial enumeration
On the expressive power of categorial grammars with unique category assignment
Fractal automata: recursion in context-free and in deterministic and linear context-free languages
Subtyping context-free session types
Algorithmic complexity of theories with Kleene iteration
A descriptive characterisation of linear languages
On translating context-free grammars into Lambek grammars
Conjunctive grammars with restricted disjunction
An elementary proof of a generalization of double Greibach normal form

This page was built for publication: A New Normal-Form Theorem for Context-Free Phrase Structure Grammars

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