A Quasiorder-based Perspective on Residual Automata
Formal Languages and Automata Theory
2020-07-28 v3
Abstract
In this work, we define a framework of automata constructions based on quasiorders over words to provide new insights on the class of residual automata. We present a new residualization operation and a generalized double-reversal method for building the canonical residual automaton for a given language. Finally, we use our framework to offer a quasiorder-based perspective on NL*, an online learning algorithm for residual automata. We conclude that quasiorders are fundamental to residual automata as congruences are to deterministic automata.
Keywords
Cite
@article{arxiv.2007.00359,
title = {A Quasiorder-based Perspective on Residual Automata},
author = {Pierre Ganty and Elena Gutiérrez and Pedro Valero},
journal= {arXiv preprint arXiv:2007.00359},
year = {2020}
}