Minimal Separating Sequences for All Pairs of States

DOI10.1007/978-3-319-30000-9_14zbMath1443.68096OpenAlexW2403339536MaRDI QIDQ2798719

Joshua Moerman, Rick Smetsers, David N. Jansen

Publication date: 13 April 2016

Published in: Language and Automata Theory and Applications (Search for Journal in Brave)

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

zbMATH Keywords

partition refinementalgorithms on automata and words

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Formal languages and automata (68Q45)

Related Items (5)

State identification and verification with satisfaction ⋮ Apartness and distinguishing formulas in Hennessy-Milner logic ⋮ Unnamed Item ⋮ A new approach for active automata learning based on apartness ⋮ Enhancing Automata Learning by Log-Based Metrics

This page was built for publication: Minimal Separating Sequences for All Pairs of States