DLIQ: A deterministic finite automaton learning algorithm through inverse queries

F Haneef, MA Sindhu - Information Technology and Control, 2022 - itc.ktu.lt
Automaton learning has attained a renewed interest in many interesting areas of software
engineering including formal verification, software testing and model inference. An …

Interpreting Finite Automata for Sequential Data

CA Hammerschmidt, S Verwer, Q Lin… - arXiv preprint arXiv …, 2016 - arxiv.org
Automaton models are often seen as interpretable models. Interpretability itself is not well
defined: it remains unclear what interpretability means without first explicitly specifying …

Handwritten recognition based on hand gesture recognition using deterministic finite automata and fuzzy logic

M Zare, M Jampour, AS Arezoomand… - 2019 4th International …, 2019 - ieeexplore.ieee.org
Hand Gesture Recognition (HGR) is one of the most interesting branches in computer vision
with lots of applications in mobiles, tablets, personal computers, and interactive platforms …

Weighted recognizability over infinite alphabets

M Pittou, G Rahonis - Acta Cybernetica, 2017 - cyber.bibl.u-szeged.hu
We introduce weighted variable automata over infinite alphabets and commutative
semirings. We prove that the class of their behaviors is closed under sum, and under scalar …

[PDF][PDF] Post Hoc Explanations for RNNs using State Transition Representations for Time Series Data.

G Gupta - xAI (Late-breaking Work, Demos, Doctoral Consortium), 2023 - ceur-ws.org
The interpretability of deep learning models has gained the attention of many researchers
and organisations in recent years. The doctoral research wilwill include the interpretability …

[引用][C] Learning State Machines from data streams and an application in network-based threat detection

H Schouten - 2018