Inference of Uniquely Terminating EML

DOI10.1007/978-3-540-88009-7_25MaRDI QIDQ3528432zbMATH OpenOpenAlexFDO

Authors S. Kannamma, K. Rangarajan, Durairaj Gnanaraj Thomas

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_25

Mathematics Subject Classification ID

Computational learning theory (68Q32) Formal languages and automata (68Q45) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• scientific article; zbMATH DE number 3932171
• A note on inferring uniquely terminating code languages
• Proving Termination by Invariance Relations
• scientific article; zbMATH DE number 2044516
• Inferring uniquely terminating regular languages from positive data
• scientific article; zbMATH DE number 1746563
• Enumerating Independent Linear Inferences
• scientific article; zbMATH DE number 815730
• The uniqueness of extremum estimation

Cited in

(1)

• A note on inferring uniquely terminating code languages

This page was built for publication: Inference of Uniquely Terminating EML

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