Representations of the language recognition problem for a theorem prover

DOI10.1007/BF00977256MaRDI QIDQ4770508zbMATH OpenOpenAlexFDO

Authors Jack Minker, Gordon J. VanderBrug

Publication date 1974

Published in International Journal of Computer & Information Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf00977256

Mathematics Subject Classification ID

Pattern recognition, speech recognition (68T10)

Cites work

• scientific article; zbMATH DE number 3212023 (Why is no real title available?)
• scientific article; zbMATH DE number 3303654 (Why is no real title available?)
• scientific article; zbMATH DE number 3311755 (Why is no real title available?)
• scientific article; zbMATH DE number 3346109 (Why is no real title available?)
• scientific article; zbMATH DE number 3388535 (Why is no real title available?)
• scientific article; zbMATH DE number 3395363 (Why is no real title available?)
• scientific article; zbMATH DE number 3415409 (Why is no real title available?)
• A Computing Procedure for Quantification Theory
• A Machine-Oriented Logic Based on the Resolution Principle
• Extracting information from resolution proof trees
• Finding resolution proofs and using duplicate goals in AND/OR trees
• On certain formal properties of grammars
• Recognition and parsing of context-free languages in time n3
• State-space problem-reduction, and theorem proving—some relationships
• The Unit Proof and the Input Proof in Theorem Proving

This page was built for publication: Representations of the language recognition problem for a theorem prover

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