Counter automata:
The counter automaton comprises of an fsm M augmented by the register (or counter) C which can hold a single integer of random size. C is initialized to zero. M can decrement and increment the counter and then test it for 0. Therefore, M’s memory is un-bounded, and arguments of the type ‘FAs can’t count’, as formalized in pumping lemma. In principle, any amount of data can be coded to a single integer. For illustration, a sequence of 3 integers a, b and c can encoded reversibly by the single integer 2a 3b 5c (Goedel numbering). Therefore, a CA consists of all the storage capacity one might require. Its computational power is restricted by the access operations limited to increment, decrement and test for 0. Due to such, counter automata ‘can’t do much more than count’.
As an illustration, each of the given counter automata accepts the language of all the strings over A = {a, b} with an equivalent number of a’s and b’s:
The transition is activated by a pair (that is, input symbol, state of counter) and triggers an action on counter.
Testable states of counter are ‘=0’ and ‘≠0’, and the counter actions are decrement ‘dec’ and increment ‘inc’.
Rather than reading an input symbol, M can as well act based on the counter state alone that we represent as ‘reading the null string ε’. M might ignore the state of counter, which we represent by ‘-’ = ‘don’t care’. Finally, M might select to execute no action on the counter C, that we denote by ‘-’ = ‘don’t act’.
Example: Parenthesis expressions. The polish or parenthesis-free notation is for arithmetic expressions.
i) Let consider the language L1 of accurate parenthesis expressions over the alphabet A = {(, )}. Illustrations of correct expressions: (( ) ), ( ) ( ), ( ( ) ) ( ), and the null string ε. Either: exhibit a counter automaton M1 which accepts the language L1 , or exhibit that no such counter automaton exists.
ii) Let consider the language L2 of accurate parenthesis expressions over alphabet A = {(, ), [, ]}, including two pairs of parentheses. Illustrations of accurate expressions: ([ ]), ( ) [ ] ( ), ( ( ) [] ) ( ), and the null string ε. Illustration of a wrong expression: ( [ ) ]. Either: Show a counter automaton M2 which accepts the language L2, or argue that no such counter automaton is exists.
iii) Polish or parenthesis-free notation for an arithmetic expressions come in two versions: suffix and prefix notation.
Let consider operands designated by the single letter, say x, y or z, and four binary operators +, -, *, /. In the prefix notation, the operator is written before its 2 operands, and in suffix notation after x + y becomes +xy or xy+.
Design a counter automaton P which recognizes accurate prefix expressions and a counter automaton S which recognizes accurate suffix expressions.
Latest technology based Theory of Computation Online Tutoring Assistance
Tutors, at the www.tutorsglobe.com, take pledge to provide full satisfaction and assurance in Theory of Computation help via online tutoring. Students are getting 100% satisfaction by online tutors across the globe. Here you can get homework help for Theory of Computation, project ideas and tutorials. We provide email based Theory of Computation help. You can join us to ask queries 24x7 with live, experienced and qualified online tutors specialized in Theory of Computation. Through Online Tutoring, you would be able to complete your homework or assignments at your home. Tutors at the TutorsGlobe are committed to provide the best quality online tutoring assistance for Theory of Computation Homework help and assignment help services. They use their experience, as they have solved thousands of the Theory of Computation assignments, which may help you to solve your complex issues of Theory of Computation. TutorsGlobe assure for the best quality compliance to your homework. Compromise with quality is not in our dictionary. If we feel that we are not able to provide the homework help as per the deadline or given instruction by the student, we refund the money of the student without any delay.
Half coil winding is that winding where the number of coils per phase is equivalent to half the number of poles in the machines
Factors affecting Population tutorial all along with the key concepts of Birth rate or Natality rate, Death or Mortality rate, Age distribution, Permanence of movement, Migratory selection, Effects on populations, Abiotic and biotic factors
tutorsglobe.com gibbs free energy assignment help-homework help by online chemical thermodynamics tutors
Animal Kingdom Diversity tutorial all along with the key concepts of Phylum Porifera, Phylum Cnidaria, Phylum Platyhelminthes, Phylum Rotifera, Phylum Nematoda, Phylum Annelida, Phylum Mollusca, Phylum Arthropoda, Phylum Echinodermata, Phylum Chordata
Such as xylem, phloem is as well a complex tissue. It conducts food materials to several parts of the plant.
tutorsglobe.com fungi assignment help-homework help by online infections tutors
Mechanism of Antibody Formation tutorial all along with the key concepts of Theories of Antibody Formation, Production of Antibodies, Qualitative Changes and Cellular Events, Antigen/antibody interactions, Lymphocytes, B-Lymphocytes and T-Lymphocytes
tutorsglobe.com radiation assignment help-homework help by online control of microorganisms tutors
The principle that underlying the group statement of financial position is that it should present the situation like if all the assets and claims of individual group members were directly the assets and claims of the parent company.
tutorsglobe.com criticism of marshall statement assignment help-homework help by online alfred marshall’s definition tutors
Theory and lecture notes of Sample data base design all along with the key concepts of sample data base design, data management. Tutorsglobe offers homework help, assignment help and tutor’s assistance on Sample data base design.
www.tutorsglobe.com offers diels-alder cycloaddition homework help, diels-alder cycloaddition assignment help, online tutoring assistance, organic chemistry solutions by online qualified tutor's help.
tutorsglobe.com sorting assignment help-homework help by online computer science tutors
Introduction to Lower Plants tutorial all along with the key concepts of Introduction to Bryophytes, Pterifophytes, Pteropyta, Features of ferns and Life cycle of fern
basic thermodynamic concepts tutorial all along with the key concepts of First Law of Thermodynamics, Isothermal Process, Equation of Reversible Adiabatic Change, Temperature Change in Adiabatic Process, Enthalpy and Internal Energy, Specific Heats for Ideal Gases
1948393
Questions Asked
3689
Tutors
1493846
Questions Answered
Start Excelling in your courses, Ask an Expert and get answers for your homework and assignments!!