76 citations · 440 across the 53 of their papers we have counts for
4 papers · 1 filter
Automatic complexity of Fibonacci and Tribonacci words
Bjørn Kjos-Hanssen
For a complexity function , the lower and upper -complexity rates of an infinite word are \[ \underline{C}(\mathbf x)=\liminf_{n\to\infty} \frac{C(\mathbf{x}\uph…
A conflict between some semantic conditions of Carmo and Jones for contrary-to-duty obligations
Bjørn Kjos-Hanssen
We show that Carmo and Jones' condition 5(e) conflicts with the other conditions on their models for contrary-to-duty obligations. We then propose a resolution to the conflict.
From eventually different functions to pandemic numberings
Achilles A. Beros, Mushfeq Khan, Bjørn Kjos-Hanssen +1
A function is strongly non-recursive (SNR) if it is eventually different from each recursive function. We obtain hierarchy results for the mass problems associated with computing s…
VC-dimensions of nondeterministic finite automata for words of equal length
Bjørn Kjos-Hanssen, Clyde James Felix, Sun Young Kim +2
Let denote the set of languages accepted by nondeterministic finite automata with states over an alphabet with letters. Let denote the set of words of leng…