in Combinatory edited by
116 views
0 votes
0 votes
  1. Find a recurrence relation for the number of ternary strings of length $n$ that contain either two consecutive $0s$ or two consecutive $1s.$
  2. What are the initial conditions?
  3. How many ternary strings of length six contain two consecutive $0s$ or two consecutive $1s?$
in Combinatory edited by
by
116 views

Please log in or register to answer this question.

Related questions

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true