A Fresh Approach to Learning Register Automata
Authors:
- 1 January 2013
- book chapter
- Published by Springer Nature
- p. 118-130
Abstract
No abstract availableKeywords
This publication has 23 references indexed in Scilit:
- Automata Learning through Counterexample Guided Abstraction Refinement2012
- Model Checking Languages of Data WordsLecture Notes in Computer Science, 2012
- Two-variable logic on data wordsACM Transactions on Computational Logic, 2011
- A Succinct Canonical Register Automaton ModelLecture Notes in Computer Science, 2011
- libalf: The Automata Learning Framework2010
- On notions of regularity for data languagesTheoretical Computer Science, 2010
- 19 Model CheckingLecture Notes in Computer Science, 2005
- On the Correspondence Between Conformance Testing and Regular InferenceLecture Notes in Computer Science, 2005
- Learning Assumptions for Compositional Verification2003
- Learning regular sets from queries and counterexamplesInformation and Computation, 1987