Recursive Language | Youth4work Blogs

Sarani Bhattacharyya
Software Engineer
Kolkata, , India
HTML Network Engineer C Language C Plus Plus
GCETTS-Government College of Engineering And Textile Technology Serampore

Recursive Language

Sarani Bhattacharyya 05 Feb 2018

156 Views

0 Comments

For a given language if a turing machine can be designed which will halt on below 2 decisions:
Whether String belongs to language
Whether String does not belong to language
then that language will be recursive language.

- Social Share
  for this Blog
- Tweet
Comment

Porfolio And Blogs

Sarani Bhattacharyya follows various companies, these companies and employers can view Sarani's resume.

Upload your resume to get best job opportunities.

Register free!

Sarani-Bhattacharyya's Blogs/Portfolios

Linear-Bounded Automata

A Turing machine has an infinite supply of blank tape. A linear-bounded automaton (lba) is a Turing machine whose tape is only kn squares long, where ...

Recursive Enumerable Language

For a given language if a turing machine can be designed then that language will be recursive enumerable language. Halting Problem: If turing machin...