in Mathematical Logic retagged by
567 views
0 votes
0 votes
Find a recurrence relation for the number of ternary strings of length n that do not contain two consecutive 0s or two consecutive 1s.
Find the same for binary strings.

Also write the initial conditions.
in Mathematical Logic retagged by
by
567 views

2 Comments

@umang_16

@arjun
0
0
0
0

1 Answer

0 votes
0 votes
Are we have to write recurrance relation or regular  expression? check the question please

1 comment

It is recurrence relation for sure.
0
0
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