scientific article; zbMATH DE number 3254900
From MaRDI portal
Publication:5541334
zbMath0158.25307MaRDI QIDQ5541334
No author found.
Publication date: 1961
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
The language intersection problem for non-recursive context-free grammars ⋮ Iteration theorems for families of strict deterministic languages ⋮ Coordinated pair systems ; part I : Dyck works and classical pumping ⋮ Analyzing Context-Free Grammars Using an Incremental SAT Solver ⋮ Permutations are not context-free: An application of the interchange lemma ⋮ Computation of distances for regular and context-free probabilistic languages ⋮ Extended Lambek Calculi and First-Order Linear Logic ⋮ Transductions des langages de Chomsky ⋮ The computational power of parsing expression grammars ⋮ Weighted parsing for grammar-based language models over multioperator monoids ⋮ The tree-generative capacity of combinatory categorial grammars ⋮ Some restrictions onW-grammars ⋮ Approximate matching between a context-free grammar and a finite-state automaton
