The Waterloo automaton has this property; it plays an important role in vertex minimization algorithms. In this paper, we describe a combined algorithm for generating automata with the walibad ...

Article citations More>> Melnikov, B.F. and Melnikova, E.A. (2017) Waterloo-Like Finite Automata and Algorithms for Their Automatic Construction. International Journal of Open Information Technologies ...

They are implemented using finite automata, which takes the payload of packet as input string. However, existing approaches of Finite Automata (FA), both deterministic finite automata (DFA) and ...

Recently, finite state automata, via the advent of hyperbolic and automatic groups, have become a powerful tool in geometric group theory. This paper develops a geometric approach to automata theory, ...

Automata Learning: For each significant pattern class identified, learn a compact generative automaton (such as a Finite State Automaton (FSA) or Cellular Automaton (CA)) that can reproduce instances ...