scientific article; zbMATH DE number 3254900
From MaRDI portal
Publication:5541334
Cited in
(14)- Iteration theorems for families of strict deterministic languages
- Permutations are not context-free: An application of the interchange lemma
- Transductions des langages de Chomsky
- Weighted parsing for grammar-based language models over multioperator monoids
- The tree-generative capacity of combinatory categorial grammars
- Approximate matching between a context-free grammar and a finite-state automaton
- Analyzing Context-Free Grammars Using an Incremental SAT Solver
- Coordinated pair systems ; part I : Dyck works and classical pumping
- Some restrictions onW-grammars
- ON ALTERNATING PHRASE-STRUCTURE GRAMMARS
- Extended Lambek calculi and first-order linear logic
- The language intersection problem for non-recursive context-free grammars
- An Earley-based universal error-correcting parser
- Computation of distances for regular and context-free probabilistic languages
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5541334)
