|
|
|
|
|
Gábor Kusper and Csaba Biró
In a previous paper we defined the black and white SAT problem which has exactly two solutions, where each variable is either true or false. We showed that black and white 2-SAT problems represent strongly connected directed graphs. We presented also the...
ver más
|
|
|
|
|
|
|
|
|
|
|
Boris Melnikov
Pág. 1 - 10
In this paper, we continue to consider strongly coupled automata, as a subset of ordinary nondeterministic finite automata. Based on this, strongly related regular languages are naturally defined. We consider some properties of the concept of the strong ...
ver más
|
|
|
|
|
|
|
|
|
|
|
Boris Melnikov
Pág. 1 - 10
In this paper, we continue to consider strongly coupled automata, as a subset of ordinary nondeterministic finite automata. Based on this, strongly related regular languages are naturally defined. We consider some properties of the concept of the strong ...
ver más
|
|
|
|
|
|