DLIQ: A deterministic finite automaton learning algorithm through inverse queries
Automaton learning has attained a renewed interest in many interesting areas of software
engineering including formal verification, software testing and model inference. An …
engineering including formal verification, software testing and model inference. An …
Interpreting Finite Automata for Sequential Data
Automaton models are often seen as interpretable models. Interpretability itself is not well
defined: it remains unclear what interpretability means without first explicitly specifying …
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
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 …
with lots of applications in mobiles, tablets, personal computers, and interactive platforms …
Weighted recognizability over infinite alphabets
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 …
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 …
and organisations in recent years. The doctoral research wilwill include the interpretability …