Some textbooks of formal languages and automata theory implicitly state the structural equality binary n-dimensional de Bruijn graph diagram minimum deterministic finite automaton which accepts regular language (0+1)*1(0+1)n-1. By introducing special whose accepting states are refined with two or more colors, we extend this fact to both k-ary versions. That is, prove that Brujin for colored (k-...

Background & Aims: Although the number of technology-dependent children has been increasing in Japan, it remains a challenge for these to enter nursery centers and schools. This study aimed clarify perceptions nurses at regard accepting children.