1 votes 1 votes Under Which class of language , Set of binary strings represents Fibonacci Sequence over input alphabet {0,1} ? I think either it is Context Sensitive Language or Recursive Language. Can anyone please help me ? Theory of Computation theory-of-computation identify-class-language + – ankitgupta.1729 asked Feb 24, 2018 ankitgupta.1729 297 views answer comment Share Follow See 1 comment See all 1 1 comment reply shivanisrivarshini commented Feb 24, 2018 reply Follow Share i think its recursive language 0 votes 0 votes Please log in or register to add a comment.
3 votes 3 votes I think as this sequence can't be generated withing memory Linearly bounded by input string provided we can say it is recursive. Tarun kushwaha 1 answered Feb 25, 2018 Tarun kushwaha 1 comment Share Follow See all 2 Comments See all 2 2 Comments reply ankitgupta.1729 commented Feb 25, 2018 reply Follow Share Thanks ! Tarun for your response... 0 votes 0 votes Tarun kushwaha 1 commented Feb 25, 2018 reply Follow Share it just a intuition though don't know if it's correct or not. 0 votes 0 votes Please log in or register to add a comment.
