The singleton-word language is recursive #
theorem
singletonWordLanguage_is_Recursive
{T : Type}
[Fintype T]
[DecidableEq T]
[Primcodable T]
(w : List T)
:
The singleton-word language {w} is recursive (decidable), via CS ⊆ Recursive.
The singleton-word language {w} is recursive (decidable), via CS ⊆ Recursive.