Awesome q2a theme
0 votes
3 views
Consider the alphabet Σ={0,1,2,...,9,#},and the language of strings of the form  x#y#z,where x,y and z are strings of digit such that when viewed as numbers, satisfy the equation x + y = z. For example, the string 123#45#168 is in this language because 123+45=168. Is this language regular? Justify your answer.
ago in Theory of Computation by (6 points) | 3 views

Please log in or register to answer this question.

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
Top Users 2020 Aug 03 - 09
  1. Mellophi

    97 Points

  2. Ashutosh07091999

    69 Points

  3. prakhar2810

    7 Points

  4. Kushagra गुप्ता

    7 Points

  5. srestha

    7 Points

  6. sdutta

    6 Points

  7. kuldeep kumar07

    6 Points

  8. toppoavinash

    6 Points

  9. Shoaib_Ahmed

    6 Points

  10. prashastinama

    6 Points

Weekly Top User (excluding moderators) will get free access to GATE Overflow Test Series for GATE 2021
Welcome to GATE CSE Doubts, where you can ask questions and receive answers from other members of the community.
Top Users Aug 2020
  1. Mellophi

    103 Points

  2. Ashutosh07091999

    72 Points

  3. Shaik Masthan

    13 Points

  4. srestha

    9 Points

  5. Unnayan kumar

    8 Points

  6. prakhar2810

    7 Points

  7. Sourav Kar

    7 Points

  8. anurag_yo

    7 Points

  9. Kushagra गुप्ता

    7 Points

  10. sdutta

    6 Points

7,711 questions
1,823 answers
11,131 comments
95,090 users