Brainscape's Knowledge GenomeTM

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


See full index

Formleg mál og reiknanleiki

This class was created by Brainscape user Sigríður Birna Matthíasdóttir. Visit their profile to learn more about the creator.

By: Sigríður Birna Matthíasdóttir
Start Studying

Decks in this class (15)

Notes 1
Stafrof er,
Strengur er,
Loggeng endanleg stoduvel
26  cards
1.1 FINITE AUTOMATA (endanleg stöðuvél)
What is finite automata good for,
What are finite automata and thei...,
What is a state diagram
20  cards
1.2 NONDETERMINISM (briðgeng stöðuvél)
In a nondeterministic machine,
Nondeterminism is a generalizatio...,
The difference between a determin...
10  cards
1.3 REGULAR EXPRESSIONS (reglulegar segðir)
What are regular expressions,
Describes,
1 is
26  cards
1.4 NONREGULAR LANGUAGES
Our technique for proving nonregu...,
Pumping lemma,
How to use the pumping lemma
3  cards
2.1 CONTEXT-FREE GRAMMARS (Samhengisfrjáls mál)
A grammar consists of a collectio...,
You use a grammar to describe a l...,
The sequence of substitutions to ...
12  cards
2.2 PUSHDOWN AUTOMATA (Staflavélar)
What are pushdown automata,
What does the stack do in pushdow...,
Why is it useful that pushdown au...
12  cards
3.1 TURING MACHINES (Turing vélar)
First proposed by alan turing in ...,
Similar to a finite automaton but...,
The turing machine model uses an ...
13  cards
3.2 VARIANTS OF TURING MACHINES (Afbrigði af Turing-vélum )
Alternative definitions of turing...,
A multitape turing machine,
Are turing machines more powerful...
10  cards
3.3 THE DEFINITION OF ALGORITHM
What is an algorithm,
Hilbert s problems,
What is a polynomial
6  cards
4.1 DECIDABLE LANGUAGES (Ákvarðanleiki) & 4.2 UNDECIDABILITY
We chose to represent various com...,
Decidable languages are,
Every context free language is de...
13  cards
5.1 UNDECIDABLE PROBLEMS FROM LANGUAGE THEORY
The halting problem,
Mapping reducibility,
Language a is mapping reducible t...
3  cards
7. TIME COMPLEXITY
How do we compute the running tim...,
What is asymptotic analysis,
The asymptotic notation is also c...
25  cards
8. SPACE COMPLEXITY
What is space complexity,
We typically estimate the space c...,
Savitch s theorem is one of the e...
7  cards
Tricky
Eftir mikla fyrirhofn hefur ther ...
1  cards

More about
Formleg mál og reiknanleiki

  • Class purpose General learning

Learn faster with Brainscape on your web, iPhone, or Android device. Study Sigríður Birna Matthíasdóttir's Formleg mál og reiknanleiki flashcards for their Söngskólinn í Reykjavík 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.

Learn more about spaced repetition

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?

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