Automata Learning: A Categorical Perspective

DOI10.1007/978-3-319-06880-0_20zbMath1407.68235OpenAlexW13464662MaRDI QIDQ5418974

Bart Jacobs, Alexandra Silva

Publication date: 2 June 2014

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-06880-0_20

Mathematics Subject Classification ID

Computational learning theory (68Q32) Formal languages and automata (68Q45) Categories of machines, automata (18B20)

Related Items

A categorical framework for learning generalised tree automata

Uses Software

• Antichains

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Learning regular sets from queries and counterexamples
• Adjoint machines, state-behavior machines, and duality
• Brzozowski’s Algorithm (Co)Algebraically
• Coalgebraic Bisimulation-Up-To
• Checking NFA equivalence with bisimulations up to congruence
• Brzozowski’s and Up-To Algorithms for Must Testing
• Weighted Bisimulation in Linear Algebraic Form
• Beyond Bisimulation: The “up-to” Techniques
• Algebra-coalgebra duality in brzozowski's minimization algorithm
• Enhancements of the bisimulation proof method
• Antichains: A New Algorithm for Checking Universality of Finite Automata