This class was created by Brainscape user Caroline Mckinlay. Visit their profile to learn more about the creator.
- decks
- flashcards
- learners
Decks in this class (22)
Week 1 - Strings and Languages
What is the definition of alphabe...,
What is a member of an alphabet c...,
In computing is alphabet just the...
18
cards
Week 1 - Finite Automata
What is a computational model,
Give an example of a computationa...,
What is finite automata
14
cards
Week 1 - Nondeterminism
What does it mean when a machine ...,
What does it mean when a machine ...,
What are the differences between ...
12
cards
Week 1 - NFA vs DFA
True or false there can only exis...,
What does it mean if two machines...,
True or false every nfa has an eq...
7
cards
Week 1 - Regular Expressions
List the 3 regular operations,
What is a union operation in term...,
What is a concatenation operation...
23
cards
Week 1 - GNFA
What is a generalised nondetermin...,
What restrictions are imposed on ...,
Define a gnfa in terms of compution
7
cards
Week 1 - Pumping Lemma
True or false all languages are r...,
What is the pumping lemma,
What is the property that a regul...
5
cards
Week 2 - Context-Free Grammers
What is a context free grammer,
Give an example of a rescursive s...,
What are context free languages
12
cards
Week 2 - CFG versus FA
True or false a dfa can be conver...,
How do you convert a dfa to a cfg,
True or false a regular language ...
4
cards
Week 2 - Chomsky Normal forms
What is a chomsky normal form,
True or false a cfl os in cnf,
How do you convert a cfg into cnf
3
cards
Week 2 - Pushdown Automata
What is a pushdown automata,
What is the stack in a pushdown a...,
True or false transistions of the...
3
cards
Week 2 - PDA versus CFL
True or false if a language is a ...,
What are the steps for converting...,
True or false if a language is re...
6
cards
Week 2 - Pumping Lemma for CFL
What is the pumping lemma for con...,
True or false let c be a cfl and ...,
True or false let c1 be a cfl and...
3
cards
Week 3 - Turing Machines: Introduction
What are turing machines,
What did m sipser say about turin...,
True or false real computers are ...
8
cards
Week 3 - Turing Machines: Computation
What happens when a turing machin...,
How do you write down the detail ...,
What happens if the tape head tri...
16
cards
Week 3 - Turing Machine: Examples
What is a typical symbol used in ...,
What should you do if a graphical...,
True or false turing machine grap...
3
cards
Week 3 - Turing-Church Thesis
True or false there is such thing...,
How does a multi tape turing mach...,
True or false every multi tape tu...
14
cards
Week 3- Decidable problems for Real Life
What are some decidable languages...,
True or false you can use a turin...
2
cards
Week 4 - Decidable Problems for CFL
0
cards
Week 4 - The Spectrums of Language
0
cards
Week 4 - Hilbert verus Turing
0
cards
Week 4 - The Spectrum of Languages Revisited
0
cards
More about
CS411 - Theory of Computation
- Class purpose General learning
Learn faster with Brainscape on your web, iPhone, or Android device. Study Caroline Mckinlay's CS411 - Theory of Computation flashcards for their Castlemilk High School class now!
How studying works.
Brainscape's adaptive web mobile flashcards system will drill you on your weaknesses, using a pattern guaranteed to help you learn more in less time.
Add your own flashcards.
Either request "Edit" access from the author, or make a copy of the class to edit as your own. And you can always create a totally new class of your own too!
What's Brainscape anyway?
Brainscape is a digital flashcards platform where you can find, create, share, and study any subject on the planet.
We use an adaptive study algorithm that is proven to help you learn faster and remember longer....
Looking for something else?
Theory of Computability
- 9 decks
- 51 flashcards
- 1 learners
Decks:
Mathematical Preliminaries, 8 29 Languages, 08 31 Deterministic Finite Automata 21 2, And more!
CS 115 Computer Science
- 30 decks
- 997 flashcards
- 764 learners
Decks:
Chapter 1 Checkpoint, Chapter 1 Notes Pt 1, Chapter 1 Notes Pt 2, And more!
Theory of Computation
- 5 decks
- 45 flashcards
- 2 learners
Decks:
Lecture 1 Introductory Material, Lecture 2 Basic Concepts And Proof By In, Lecture 3 Graphs And Intro To Finite Aut, And more!
