scientific article; zbMATH DE number 3254900

zbMATH Open0158.25307MaRDI QIDQ5541334FDOQ5541334

Authors:

Publication date: 1961

Title of this publication is not available (Why is that?)

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Natural language processing (68T50) Linguistics (91F20)

Cited In (14)

• The computational power of parsing expression grammars
• Approximate matching between a context-free grammar and a finite-state automaton
• Some restrictions onW-grammars
• Computation of distances for regular and context-free probabilistic languages
• ON ALTERNATING PHRASE-STRUCTURE GRAMMARS
• The language intersection problem for non-recursive context-free grammars
• Transductions des langages de Chomsky
• The tree-generative capacity of combinatory categorial grammars
• Coordinated pair systems ; part I : Dyck works and classical pumping
• Weighted parsing for grammar-based language models over multioperator monoids
• Extended Lambek calculi and first-order linear logic
• Permutations are not context-free: An application of the interchange lemma
• Analyzing Context-Free Grammars Using an Incremental SAT Solver
• Iteration theorems for families of strict deterministic 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)