Brainscape's Knowledge GenomeTM

Browse over 1 million classes created by top students, professors, publishers, and experts.


See full index

PRELIM REVIEWER > AL102 > Flashcards

AL102 Flashcards

1
Q

is a branch of theoretical computer science that deals with abstract machines

A

Formal Languages and Automata Theory

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

is a set of strings of symbols constrained by specific rules.

A

Formal Languages

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

it involves studying abstract machines or computational models that recognize patterns

A

Automata Theory

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

Used to recognize context- free languages and equipped with a stack.

A

Pushdown Automata (PDA)

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

Used to recognize regular languages.

A

Finite Automata (FA)

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

These are the most powerful class of automata,

A

Turing Machines

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

The search engine breaks down your query into tokens

A

Tokenization

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

to efficiently find occurrences of a query string within large texts.

A

Boyer-Moore algorithm

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

can be represented by regular expressions

A

Regular Languages

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

sometimes use more complex language processing techniques

A

Language Processing

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

recognized by pushdown automata.

A

Context-Free Languages

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

the most powerful and can simulate any computational process.

A

Recursive Enumerable Languages

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

is a finite sequence of symbols chosen from an alphabet.

A

Strings

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

Automata are used in verifying whether systems like operating systems

A

System Verification

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

Computer scientists can optimize algorithms and develop efficient software.

A

Computational Efficiency

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

is a set of strings formed from a given alphabet, can be finite or infinite.

A

Language

12
Q

there is exactly one transition to another state, the machine’s behavior is predictable

A

Deterministic Finite Automata (DFA)

12
Q

(denoted by Σ) is a finite set of symbols or characters.

A

Alphabet

13
Q

can transition to multiple states, or even transition without consuming any input

A

Non-Deterministic Finite Automata (NFA)

PRELIM REVIEWER (7 decks)

Brainscape helps you reach your goals faster, through stronger study habits.
© 2024 Bold Learning Solutions. Terms and Conditions