This class was created by Brainscape user M d Heijer. Visit their profile to learn more about the creator.
By:
M d Heijer
- decks
- flashcards
- learners
Decks in this class (24)
Introduction
What is the idea of universal com...,
What are the three different type...
2
cards
Words & Languages
What is the definition of a word ...,
How can a program be seen in term...,
What is concatenation
13
cards
Finite Automata
What does deterministic finite au...,
What is a configuration of a dfa,
What is a step relation what is a...
17
cards
(Regular) Grammars
That do grammars define,
What do grammars consist of when ...,
What is the derivation step of a ...
10
cards
Regular Expressions
When does a regular expression ex...,
How to construct a regular expres...,
How to construct from a regular e...
3
cards
Regular Languages
When is a property decidable,
Proof that it is decidable whethe...,
When is a word a member of a regu...
5
cards
Word Matching
How to do efficient word matching...
1
cards
Automata Minimization
What are the steps to create a mi...,
What is lexical analysis,
How do you get from characters to...
3
cards
Pumping Lemma
Proof the following generally,
What is the pumping lemma,
Give the proof of the pumping lemma
3
cards
Context-Free Languages
When is a language context free,
What are two strategies of choosi...,
What is a derivation tree
7
cards
Chomsky Normal Form
What is a lambda production rule ...,
How can context free languages re...,
What is a unit production rule ho...
5
cards
CYK Parsing
What is bottum up parsing name an...,
What is the cyk algorithm what is...
2
cards
LL Parsing
What is top down parsing,
What is the simple leftmost strategy,
What ll parsing what is its start...
13
cards
Pushdown Automata
What is the goal of pushdown auto...,
What is a step relation in a push...,
How does a transition work in an ...
11
cards
Pumping Lemma for Context-Free Languages
What is the pumping lemma for con...,
How to use the pumping lemma as a...
2
cards
Properties of Context-Free Languages
Which four rules hold for two con...,
Are the intersection difference a...,
When is a intersection of two lan...
4
cards
Turing Machines
What is a turing machine,
What is the blank symbol for a tu...,
What is a partial function turing...
12
cards
Recursively Enumerable Languages
Proof that turing machines are re...,
How do the union and intersection...,
Is the difference between two rec...
7
cards
Unrestricted Grammars
What rules does a unrestricted gr...,
How do you go from unrestricted g...,
How do you go from turing machine...
3
cards
Context-Sensitive Grammars & Linear Bounded Automata
When is a grammar context sensiti...,
What is linear bounded automaton lba,
Proof that you can go from contex...
7
cards
Chomsky Hierarchy
What is the chomsky hierarchy
1
cards
Undeciability
When is a decision problem decida...,
What is the halting problem what ...,
What is the theorem of rice give ...
8
cards
Complexity
What are the p and np complexity ...,
When is a problem in np,
When is a formula satisfiable is ...
7
cards
Exam Questions
How to count occurances with dfa,
How to minimize a dfa,
How to convert nfa to dfa
13
cards
More about
Automata & Complexity
- Class purpose General learning
Learn faster with Brainscape on your web, iPhone, or Android device. Study M d Heijer's Automata & Complexity flashcards for their Vrije Universiteit Amsterdam 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?
Appreciating Complex Midwifery Care
- 14 decks
- 586 flashcards
- 33 learners
Decks:
Diabetes In Pregnancy, Induction Of Labour, Caesarean Sections, And more!
Automata, Computability and Complexity
- 5 decks
- 95 flashcards
- 2 learners
Decks:
Regular Languages, Context Free Languages, Turing Machines, And more!
Complex Ex Management
- 11 decks
- 232 flashcards
- 9 learners
Decks:
Deck 1 Week 2, Deck 2 Week 3, Deck 3 Week 4, And more!
