Learning Register Automata with Fresh Value Generation

DOI10.1007/978-3-319-25150-9_11zbMath1471.68098OpenAlexW2271603174MaRDI QIDQ2787422

Paul Fiterău-Broştean, Fides Aarts, Harco Kuppens, Frits W. Vaandrager

Publication date: 25 February 2016

Published in: Theoretical Aspects of Computing - ICTAC 2015 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-25150-9_11

Mathematics Subject Classification ID

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

Related Items (8)

Learning One-Clock Timed Automata ⋮ Active automata learning as black-box search and lazy partition refinement ⋮ From languages to behaviors and back ⋮ On-the-fly bisimilarity checking for fresh-register automata ⋮ Learning weighted automata over principal ideal domains ⋮ Polynomial-time equivalence testing for deterministic fresh-register automata ⋮ Fast computations on ordered nominal sets ⋮ A categorical framework for learning generalised tree automata

This page was built for publication: Learning Register Automata with Fresh Value Generation