scientific article; zbMATH DE number 3254900

MaRDI QIDQ5541334zbMATH OpenFDO

Authors

Publication date 1961

Mathematics Subject Classification ID

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

Cited in

(13)

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

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)