Automata Theory > Turing Machine > Flashcards

Turing Machine Flashcards

(13 cards)

Study These Flashcards
1
Q

Six types of fundamental operation that a Turing machine performs in the course of a computation.

A
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

GRAMMAR ACCEPTED OF TYPE 0

A

Unrestricted Grammar

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

GRAMMAR ACCEPTED OF TYPE 1

A

Context Sensitive
Grammar

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

GRAMMAR ACCEPTED OF TYPE 2

A

Context Free Grammar

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

GRAMMAR ACCEPTED OF TYPE 3

A

Regular Grammar

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

LANGUAGE ACCEPTED OF TYPE 0

A

Recursively Enumerable Language

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

LANGUAGE ACCEPTED OF TYPE 1

A

Context Sensitive Language

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

LANGUAGE ACCEPTED OF TYPE 2

A

Context Free Language

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

LANGUAGE ACCEPTED OF TYPE 3

A

Regular Language

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

AUTOMATON OF TYPE 0

A

Turing Machine

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

AUTOMATON OF TYPE 1

A

Linear Bounded Automaton

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
12
Q

AUTOMATON OF TYPE 2

A

Pushdown Automaton

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
13
Q

AUTOMATON OF TYPE 3

A

Finite State Automaton

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
Automata Theory
flashcards
Decks in class (2)
# Cards
Brainscape helps you reach your goals faster, through stronger study habits.
© 2026 Bold Learning Solutions. Terms and Conditions