Learning to Complement Büchi Automata
- 29 December 2017
- book chapter
- Published by Springer Nature
- p. 313-335
Abstract
No abstract availableKeywords
This publication has 51 references indexed in Scilit:
- Learning regular omega languagesTheoretical Computer Science, 2016
- Complementing Semi-deterministic Büchi Automata2016
- Learning Register Automata with Fresh Value Generation2015
- The Hanoi Omega-Automata Format2015
- Generating models of infinite-state communication protocols using regular inference with abstractionFormal Methods in System Design, 2014
- Advanced Ramsey-Based Büchi Automata Inclusion TestingLecture Notes in Computer Science, 2011
- Simulation Subsumption in Ramsey-Based Büchi Automata Universality and Inclusion Testing2010
- Synthesis of interface specifications for Java classes2005
- Learning regular sets from queries and counterexamplesInformation and Computation, 1987
- A syntactic congruence for rational ω-languagesTheoretical Computer Science, 1985