A new approach for active automata learning based on apartness

DOI10.1007/978-3-030-99524-9_12zbMATH Open1547.68286MaRDI QIDQ6535565FDOQ6535565

Thorsten Wißmann, F. Vaandrager, Author name not available (Why is that?), Jurriaan Rot

Publication date: 23 January 2024

zbMATH Keywords

apartness relationconformance testingMealy machineactive automata learningadaptive distinguishing sequenceobservation tree

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• A note on two problems in connexion with graphs
• Title not available (Why is that?)
• Learning regular sets from queries and counterexamples
• The existence of refinement mappings
• Guarded commands, nondeterminacy and formal derivation of programs
• On the learnability of infinitary regular sets
• Learning I/O Automata
• Inference of finite automata using homing sequences
• Title not available (Why is that?)
• Regular inference as vertex coloring
• On the Synthesis of Finite-State Machines from Samples of Their Behavior
• Testing finite-state machines: state identification and verification
• Automata Learning through Counterexample Guided Abstraction Refinement
• Fundamental Approaches to Software Engineering
• Learning Behaviors of Automata from Multiplicity and Equivalence Queries
• Active learning for extended finite state machines
• Benchmarks for automata learning and conformance testing
• FM 2009: Formal methods. Second world congress, Eindhoven, The Netherlands, November 2--6, 2009. Proceedings
• Zur intuitionistischen Axiomatik der projektiven Geometrie.
• Automata Learning
• Model learning as a satisfiability modulo theories problem
• Learning Weighted Automata
• Learning weighted automata over principal ideal domains
• Learning nominal automata
• Coalgebra learning via duality
• Models, algorithms, logics and tools. Essays dedicated to Kim Guldstrand Larsen on the occasion of his 60th birthday
• The learnability of symbolic automata
• Learning Mealy machines with one timer
• Minimal Separating Sequences for All Pairs of States
• CGE: A Sequential Learning Algorithm for Mealy Automata
• Title not available (Why is that?)

Cited In (2)

• On bidirectional deterministic finite automata
• PDFA distillation with error bound guarantees

This page was built for publication: A new approach for active automata learning based on apartness

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6535565)