Cited By
View all- Dao ALee NChen LLin MJiang JMishchenko ABrayton R(2018)Efficient computation of ECO patch functionsProceedings of the 55th Annual Design Automation Conference10.1145/3195970.3196039(1-6)Online publication date: 24-Jun-2018
A representation of a Boolean function is canonical if, given a variable order, only one instance of the representation is possible for the function. A computation is canonical if the result depends only on the Boolean function and a variable order, and ...
Several canonical forms of finite automata have been introduced over the decades. In particular, if one considers the minimal deterministic finite automaton (DFA), the canonical residual finite state automaton (RFSA), and the átomaton of a ...
Several canonical forms of finite automata have been introduced over the decades. In particular, if one considers the minimal deterministic finite automaton (DFA), the canonical residual finite state automaton (RFSA), and the átomaton of a ...
Association for Computing Machinery
New York, NY, United States
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in