Approximate State Reduction of Fuzzy Finite Automata

Miroslav Ćirić
(University of Niš, Faculty of Sciences and Mathematics, Niš, Serbia) 		Ivana Micić
(University of Niš, Faculty of Sciences and Mathematics, Niš, Serbia) 		Stefan Stanimirović
(University of Niš, Faculty of Sciences and Mathematics, Niš, Serbia) 		Linh Anh Nguyen
(University of Warsaw, Institute of Informatics, Warsaw, Poland)

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.

In Zsolt Gazdag, Szabolcs Iván and Gergely Kovásznai: Proceedings of the 16th International Conference on Automata and Formal Languages (AFL 2023), Eger, Hungary, September 5-7, 2023, Electronic Proceedings in Theoretical Computer Science 386, pp. 51–66.
Published: 3rd September 2023.
ArXived at: https://dx.doi.org/10.4204/EPTCS.386.6 bibtex PDF
References in reconstructed bibtex, XML and HTML format (approximated).
Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org