Computer Networking: A Top-Down Approach (7th Edition)
Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN: 9780133594140
Author: James Kurose, Keith Ross
Publisher: PEARSON
Bartleby Related Questions Icon

Related questions

Question

Write in the programming language python:

  • A function to simulate a deterministic Turing machine (DTM)
    that (only) recognizes the language L, using the Python library automata-lib 5.0.0
    • L = {aibjck | i x j = k, i, j, k ≥ 1}

 

  • A program to input/read input_data, call/execute function. output/print result/output_data

The function may print/report only erros

The function and program must be into two separate Python files.

class DTM(TM)
The DTM class is a subclass of TM and represents a deterministic Turing machine. It can be found under
automata/tm/dtm.py.
Every DTM has the following (required) properties:
1. states: a set of the DTM's valid states, each of which must be represented as a string
2. input_symbols: a set of the DTM's valid input symbols represented as strings
3. tape_symbols: a set of the DTM's valid tape symbols represented as strings
4. transitions: a dict consisting of the transitions for each state; each key is a state name and each value is a
dict which maps a symbol (the key) to a state (the value)
5. initial state: the name of the initial state for this DTM
6. blank_symbol: a symbol from tape_symbols to be used as the blank symbol for this DTM
7. final states: a set of final states for this DTM
expand button
Transcribed Image Text:class DTM(TM) The DTM class is a subclass of TM and represents a deterministic Turing machine. It can be found under automata/tm/dtm.py. Every DTM has the following (required) properties: 1. states: a set of the DTM's valid states, each of which must be represented as a string 2. input_symbols: a set of the DTM's valid input symbols represented as strings 3. tape_symbols: a set of the DTM's valid tape symbols represented as strings 4. transitions: a dict consisting of the transitions for each state; each key is a state name and each value is a dict which maps a symbol (the key) to a state (the value) 5. initial state: the name of the initial state for this DTM 6. blank_symbol: a symbol from tape_symbols to be used as the blank symbol for this DTM 7. final states: a set of final states for this DTM
Expert Solution
Check Mark
Knowledge Booster
Background pattern image
Similar questions
Recommended textbooks for you
Text book image
Computer Networking: A Top-Down Approach (7th Edi...
Computer Engineering
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:PEARSON
Text book image
Computer Organization and Design MIPS Edition, Fi...
Computer Engineering
ISBN:9780124077263
Author:David A. Patterson, John L. Hennessy
Publisher:Elsevier Science
Text book image
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:9781337569330
Author:Jill West, Tamara Dean, Jean Andrews
Publisher:Cengage Learning
Text book image
Concepts of Database Management
Computer Engineering
ISBN:9781337093422
Author:Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:Cengage Learning
Text book image
Prelude to Programming
Computer Engineering
ISBN:9780133750423
Author:VENIT, Stewart
Publisher:Pearson Education
Text book image
Sc Business Data Communications and Networking, T...
Computer Engineering
ISBN:9781119368830
Author:FITZGERALD
Publisher:WILEY