A Robust Class of Data Languages and an Application to Learning

DOI10.2168/LMCS-10(4:19)2014zbMath1448.68258arXiv1411.6646OpenAlexW1793241515MaRDI QIDQ2938772

Peter Habermehl, Benedikt Bollig, Benjamin Monmege, Martin Leucker

Publication date: 15 January 2015

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

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

zbMATH Keywords

data wordsregister automatafreshnessAngluin-style learning

Mathematics Subject Classification ID

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

Related Items

On-the-fly bisimilarity checking for fresh-register automata, Nominal Automata with Name Binding, Unnamed Item, Polynomial-time equivalence testing for deterministic fresh-register automata, A Note on C² Interpreted over Finite Data-Words, Unnamed Item, Unnamed Item

Uses Software

• libalf