A Fresh Approach to Learning Register Automata

DOI10.1007/978-3-642-38771-5_12zbMath1381.68103OpenAlexW82980056MaRDI QIDQ5300834

Benedikt Bollig, Martin Leucker, Benjamin Monmege, Peter Habermehl

Publication date: 28 June 2013

Published in: Developments in Language Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-38771-5_12

Mathematics Subject Classification ID

Computational learning theory (68Q32) Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05)

Related Items

Active learning for deterministic bottom-up nominal tree automata, Learning Transparent Data Automata, Fast computations on ordered nominal sets, Active learning for extended finite state machines