Finite State Methods and Description Logics
Tim Fernando · 2013
Abstract. The accepting runs of a finite automaton are represented as concepts in a Description Logic, for various systems of roles computed by finitestate transducers. The representation refines the perspective on regular languages provided by Monadic Second-Order Logic (MSO), under the Büchi-Elgot-Trakhtenbrot theorem. String symbols are structured as sets to succinctly express MSO-sentences, with auxiliary symbols conceived as variables bound by quantifiers. 1