The work provides an efficient algorithm for computing minimal input character explanations for finite automata decisions.
PWS Publishing Company
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
verdicts
UNVERDICTED 2representative citing papers
A (3(1+ε)n + o(n))-bit representation of maximal palindromes with O(1) query time, O(n) construction, and an O(n)-bit application for longest palindromes in arbitrary factors.
citing papers explorer
-
A Formal Framework for the Explanation of Finite Automata Decisions
The work provides an efficient algorithm for computing minimal input character explanations for finite automata decisions.
-
Almost succinct representation of maximal palindromes
A (3(1+ε)n + o(n))-bit representation of maximal palindromes with O(1) query time, O(n) construction, and an O(n)-bit application for longest palindromes in arbitrary factors.