Brainscape's Knowledge GenomeTM

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


See full index

Computer Architecture > 3.3 Finite State Machines > Flashcards

3.3 Finite State Machines Flashcards

1
Q

What is an alphabet, string and language

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

Broadly how are different machines ranked in power (combinatorial, finite etc.)

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

What is the definition of a Finite State Machine (its inputs/outputs)

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

What is the definition of regular expressions / operators

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

Computer Architecture (34 decks)

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