On the transition reduction problem for finite automata
el Houcein el Abdalaoui, Mohamed Dahmoune, Djelloul Ziadi
TL;DR
This paper investigates the transition reduction problem for nondeterministic automata, focusing on automata recognizing specific languages defined by regular expressions, and provides results that could be applicable to broader cases.
Contribution
It presents new results on transition reduction for automata recognizing languages defined by a specific class of regular expressions, aiding general reduction strategies.
Findings
Derived reduction techniques for automata recognizing $L(E_n)$
Results applicable to broader transition reduction problems
Enhanced understanding of automata minimization processes
Abstract
We are interested in the problem of transition reduction of nondeterministic automata. We present some results on the reduction of the automata recognizing the language denoted by the regular expression . These results can be used in the general case of the transition reduction problem.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
Topicssemigroups and automata theory · Machine Learning and Algorithms · DNA and Biological Computing