Learning Regular Languages over Large Ordered Alphabets

DOI10.2168/LMCS-11(3:13)2015zbMath1448.68271arXiv1506.00482MaRDI QIDQ3196344

Irini-Eleftheria Mens, Oded Maler

Publication date: 29 October 2015

Published in: Logical Methods in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1506.00482

zbMATH Keywords

active learningsymbolic automata

Mathematics Subject Classification ID

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

Related Items (6)

Learning One-Clock Timed Automata ⋮ Enhancing active model learning with equivalence checking using simulation relations ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Learning Symbolic Automata ⋮ Regular \(\omega\)-languages with an informative right congruence

This page was built for publication: Learning Regular Languages over Large Ordered Alphabets