Context-Sensitive Grammars & Linear Bounded Automata Flashcards

1
Q

When is a grammar context-sensitive? When is a language context-sensitive?

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

What is linear bounded automaton (LBA)?

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

Proof that you can go from Context-Sensitive Grammar to LBA.

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

Proof that you can go from LBA to Context-Sensitive Grammar.

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

What are the 7 basic properties of Context-Sensitive languages?

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

Proof that Context-sensitive languages are recursive.

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

Proof that not every context-sensitive language is recursive.

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