Transition Complexity of Incomplete DFAs
Copyright policy )Transition Complexity of Incomplete DFAs
We consider the transition complexity of regular languages based on the incomplete deterministic finite automata. We establish tight bounds for the transition complexity of Boolean operations, in the case of union the upper and lower bounds differ by a multiplicative constant two. We show that the transition complexity results for union and complementation are very different from the state complexity results for the same operations. However, for intersection, the transition complexity bounds turn out to be similar to the corresponding bounds for state complexity.
- Queen's University (Ontario, Canada) Canada
- Western University Canada
- Queen's University Canada
FOS: Computer and information sciences, deterministic finite automaton, Formal Languages and Automata Theory (cs.FL), transition complexity, Computer Science - Formal Languages and Automata Theory, QA75.5-76.95, Formal languages and automata, regular languages, Boolean operations, Electronic computers. Computer science, QA1-939, incomplete automaton, Mathematics
FOS: Computer and information sciences, deterministic finite automaton, Formal Languages and Automata Theory (cs.FL), transition complexity, Computer Science - Formal Languages and Automata Theory, QA75.5-76.95, Formal languages and automata, regular languages, Boolean operations, Electronic computers. Computer science, QA1-939, incomplete automaton, Mathematics
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).14 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Average influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Top 10% impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average
Citations provided by BIP!Popularity provided by BIP!