Evaluation and Comparison of Inferred Regular Grammars

DOI10.1007/978-3-540-88009-7_20zbMath1177.68129OpenAlexW2139300931MaRDI QIDQ3528425

Kirill Bogdanov, Ken H. Johnson, Neil Walkinshaw

Publication date: 16 October 2008

Published in: Grammatical Inference: Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-88009-7_20

zbMATH Keywords

evaluationmodel-based testingprecision and recallFSM testingstate-merging

Mathematics Subject Classification ID

Computational learning theory (68Q32) Grammars and rewriting systems (68Q42) Natural language processing (68T50)

Cites Work

• Testing methods for X-machines: a review
• Adaptive Model Checking
• Unsupervised Learning of Probabilistic Context-Free Grammar using Iterative Biclustering
• Testing Software Design Modeled by Finite-State Machines
• Fundamental Approaches to Software Engineering
• Language identification in the limit
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Evaluation and Comparison of Inferred Regular Grammars