7 citations · 7 across the 3 of their papers we have counts for
1 paper · 1 filter
Kristína Čevorová, Galina Jirásková, Peter Mlynárčik +2
We study the complexity of basic regular operations on languages represented by incomplete deterministic or nondeterministic automata, in which all states are final. Such languages…