The state complexity of Kleene closure is defined as the minimal number of states that are sufficient and necessary in the worst case for a DFA to accept the Kleene closure of a regular language represented by an n-state DFA.
We show that the state complexity of the Kleene closure of a prefix-free language with state complexity n may attain just three possible values n − 2,n − 1, and ...
Oct 14, 2016 · Our main result shows that the upper bounds on the state complexity of Kleene closure of a language accepted by an n -state DFA with k final states are tight ...
We also study Kleene Closure on prefix-free languages. In the case of prefix-free languages, the Kleene closure may attain just three possible complexities n − ...
Our main result shows that the upper bounds 2 n − 1 + 2 n − 1 − k on the state complexity of Kleene closure of a language accepted by an n -state DFA with k ...
Our main result shows that the upper bounds 2ⁿ⁻¹+2n-1-k on the state complexity of Kleene closure of a language accepted by an n-state DFA with k final states ...
Scholarly Journal. Kleene closure and state complexity. Palmovský, Matúš. Theoretical Informatics and Applications; Paris Vol. 50, Iss. 3, (Jul-Sep 2016). DOI ...
People also ask
What is the difference between Kleen closure and positive closure?
What is the Kleene star in automata?
What is the difference between Kleene star and Kleene plus?
What is a Kleene closure?
May 16, 2016 · Given an n-state DFA (over a binary or any fixed alphabet), what is the complexity of computing its Kleene closure DFA? What is the largest ...
Mar 10, 2023 · Bibliographic details on Kleene Closure and State Complexity.
Aug 31, 2022 · We investigate the accepting state complexity of deterministic finite automata for regular languages obtained by applying one of the following operations to ...
Missing: closure | Show results with:closure