in Combinatory edited by
152 views
0 votes
0 votes
  1. Find a recurrence relation for the number of ternary strings of length $n$ that do not contain consecutive symbols that are the same.
  2. What are the initial conditions?
  3. How many ternary strings of length six do not contain consecutive symbols that are the same?
in Combinatory edited by
by
152 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