Learning Regular Languages Using Nondeterministic Finite Automata

DOI10.1007/978-3-540-70844-5_10zbMath1172.68508OpenAlexW1604149093MaRDI QIDQ3602804

No author found.

Publication date: 12 February 2009

Published in: Implementation and Applications of Automata (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-70844-5_10

Mathematics Subject Classification ID

Computational learning theory (68Q32) Formal languages and automata (68Q45)

Related Items (3)

Learning Symbolic Automata ⋮ Parallel Algorithms for Minimal Nondeterministic Finite Automata Inference ⋮ Learning algorithms

This page was built for publication: Learning Regular Languages Using Nondeterministic Finite Automata