Efficient regular grammatical inference for pattern recognition

DOI10.1016/0031-3203(84)90063-3zbMATH Open0528.68065OpenAlexW1980101464MaRDI QIDQ786555FDOQ786555

Authors: M. Richetin, François Vernadat 

Publication date: 1984

Published in: Pattern Recognition (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0031-3203(84)90063-3

zbMATH Keywords

handwritten numeralsinference of regular grammars or finite automatalearning stringssuccessor methodsyntactic pattern recongition

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Pattern recognition, speech recognition (68T10)

Cites Work

• Syntactic methods in pattern recognition
• On the Synthesis of Finite-State Machines from Samples of Their Behavior
• Grammatical Inference: Introduction and Survey - Part I
• Title not available (Why is that?)

Cited In (1)

• Efficient regular grammatical inference techniques by the use of partial similarities and their logical relationships

This page was built for publication: Efficient regular grammatical inference for pattern recognition

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