Approximate State Reduction of Fuzzy Finite Automata

Abstract

In this paper we introduce a new type of approximate state reductions where the behaviors of the reduced and the original automaton do not have to be identical, but they must match on all words of length less than or equal to some given natural number. We provide four methods for performing such reductions.Comment: In Proceedings AFL 2023, arXiv:2309.0112