Regular Languages Flashcards

You may prefer our related Brainscape-certified flashcards:
1
Q

What is a mealy machine?

A

A finite state machine that generates an output for every transition.

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

What does l mean in regular expressions?

A

Or, it separates alternatives.

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

What does * mean in regular expressions?

A

0 or more of the preceding element.

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

What does + mean in regular expressions?

A

1 or more of the preceding element.

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

What does ? mean in regular expressions?

A

0 or 1

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

Define an intractable problem.

A

A problem that can be solved but not in polynomial / reasonable time.

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

How can you solve some intractable problems?

A

Using heuristic methods.

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

Define a set.

A

An unordered collection of elements.

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

A

Member of

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

A

Not a member of

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

A

Intersection

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

A

Union

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

A\B

A

Elements that are in A but not B (difference)

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

|

A

Such that

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

Λ

A

And

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

Define a Turing Machine

A

A computer with a single fixed program. (it only solves one problem)

17
Q

What are the components of a Turing Machine?

A
  • A finite set of states
  • A finite alphabet of symbols
  • An infinite tape with marked off squares
  • A sensing read-write head that travels along the tape one square at a time.
18
Q

Line for a one-to-one relationship

A

19
Q

Line for a one-to-many relationship

A

20
Q

Line for a many-to-many relationship

A

> ─