A Family of Algorithms for Non Deterministic Regular Languages Inference

DOI10.1007/11812128_25zbMath1160.68390OpenAlexW1491796962MaRDI QIDQ5757244

No author found.

Publication date: 6 September 2007

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

Full work available at URL: https://doi.org/10.1007/11812128_25

Mathematics Subject Classification ID

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

Related Items (3)

Universal automata and NFA learning ⋮ Parallel Algorithms for Minimal Nondeterministic Finite Automata Inference ⋮ Learning algorithms

This page was built for publication: A Family of Algorithms for Non Deterministic Regular Languages Inference