2 citations · 2 across the 2 of their papers we have counts for
2 papers
cs.FL2009
Quotient complexity of ideal languages
J. Brzozowski, G. Jirásková, B. Li
We study the state complexity of regular operations in the class of ideal languages. A language L over an alphabet Sigma is a right (left) ideal if it satisfies L = L Sigma* (L = S…
cs.FL2009★ 2 cited
Nondeterministic State Complexity of Positional Addition
Galina Jirásková, Alexander Okhotin
Consider nondeterministic finite automata recognizing base-k positional notation of numbers. Assume that numbers are read starting from their least significant digits. It is proved…