Skip to main content
Computer Science

Return to Question

Bumped by Community user
Bumped by Community user
Bumped by Community user
deleted 1 character in body; edited title
Source Link
Yuval Filmus
Yuval Filmus
  • 279.1k
  • 27
  • 316
  • 512

Construct an LBA for $L = \{a^nb^{2n} \mid n\geq1 \}$

I want to construct a linear bounded automata for the language L = {a^nb^(2n) | n>=1 }$L = \{a^nb^{2n} \mid n\geq1 \}$ . I know how LBA works but I don't have an idea how it can countscount the numbers of a's and check if the b's are 2 times more than a's.I I would like to to hear some suggestions. Thanks :)

Construct an LBA

I want to construct a linear bounded automata for the language L = {a^nb^(2n) | n>=1 } . I know how LBA works but I don't have an idea how it can counts the numbers of a's and check if the b's are 2 times more than a's.I would like to to hear some suggestions. Thanks :)

LBA for $L = \{a^nb^{2n} \mid n\geq1 \}$

I want to construct a linear bounded automata for the language $L = \{a^nb^{2n} \mid n\geq1 \}$ . I know how LBA works but I don't have an idea how it can count the numbers of a's and check if the b's are 2 times more than a's. I would like to to hear some suggestions.

Source Link
Hans Christian
Hans Christian
  • 13
  • 1
  • 5

Construct an LBA

I want to construct a linear bounded automata for the language L = {a^nb^(2n) | n>=1 } . I know how LBA works but I don't have an idea how it can counts the numbers of a's and check if the b's are 2 times more than a's.I would like to to hear some suggestions. Thanks :)