Learning Deterministic Finite Automata from Interleaved Strings

DOI10.1007/978-3-642-15488-1_8zbMath1291.68195OpenAlexW1550014776MaRDI QIDQ3588367

Tim Oates, Joshua Y. L. Jones

Publication date: 10 September 2010

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

Full work available at URL: https://doi.org/10.1007/978-3-642-15488-1_8

zbMATH Keywords

regular languageslearning in the limitinterleaved languagesworkflow inference

Mathematics Subject Classification ID

Computational learning theory (68Q32) Formal languages and automata (68Q45) Grammars and rewriting systems (68Q42)

This page was built for publication: Learning Deterministic Finite Automata from Interleaved Strings