Scribd Logo
Upload

Welcome to Scribd!

  • (LabManual) CE FOE11112 (6) SP TUTORIAL - 1

    Uploaded by

    Bhavin Ghelani
    8 views1 page
    This document provides instructions for a systems programming tutorial assignment. It lists 4 problems for students to solve. For each problem, students are asked to provide a regular expression, state diagram for a finite automaton, and C program that validates strings for the given language. The problems involve languages such as anbm where n and m are greater than or equal to 1, binary numbers divisible by 3, C printf statements, and prefixes of the string ababababab repeated. The tutorial is due on January 24th, 2012 and was prepared by an assistant professor of MEFGI.

    Original Description:

    Original Title

    (LabManual)CE-FOE11112(6)-SP-TUTORIAL_1

    Copyright

    © Attribution Non-Commercial (BY-NC)

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    This document provides instructions for a systems programming tutorial assignment. It lists 4 problems for students to solve. For each problem, students are asked to provide a regular expression, state diagram for a finite automaton, and C program that validates strings for the given language. The problems involve languages such as anbm where n and m are greater than or equal to 1, binary numbers divisible by 3, C printf statements, and prefixes of the string ababababab repeated. The tutorial is due on January 24th, 2012 and was prepared by an assistant professor of MEFGI.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    8 views1 page

    (LabManual) CE FOE11112 (6) SP TUTORIAL - 1

    Uploaded by

    Bhavin Ghelani
    This document provides instructions for a systems programming tutorial assignment. It lists 4 problems for students to solve. For each problem, students are asked to provide a regular expression, state diagram for a finite automaton, and C program that validates strings for the given language. The problems involve languages such as anbm where n and m are greater than or equal to 1, binary numbers divisible by 3, C printf statements, and prefixes of the string ababababab repeated. The tutorial is due on January 24th, 2012 and was prepared by an assistant professor of MEFGI.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    of 1

    MARWADI EDUCATION FOUNDATION GROUP OF INSTITUTIONS FACULTY OF ENGINEERING CE &IT DEPARTMENT Subject: System Programming Semester: 6th CE

    Tutorial 1
    Issue date: 9/1/12 Due date:24/1/12 1. Let L = {anbm / n,m >=1} be a language. Give regular expression for the language and draw a state diagram for finite automata of given language. Also create a C-program that validates the strings of this language. 2. Let L = {All binary numbers which are divisible by 3} be a language. Give regular expression for the language and draw a state diagram for finite automata of given language. Also create a C-program that validates the strings of this language. 3. Let L = {Printf statement of C-language} be a language. Give regular expression for the language and draw a state diagram for finite automata of given language. Also create a Cprogram that validates the strings of this language. 4. Let L = {All prefixes of ababababab} be a language. Give regular expression for the language and draw a state diagram for finite automata of given language. Also create a Cprogram that validates the strings of this language.

    Prepared By: Tejas Chauhan Asst. Prof., MEFGI.

    You might also like