Thesis Details

Paralelní hluboké zásobníkové automaty

Bachelor's Thesis Student: Solár Peter Academic Year: 2006/2007 Supervisor: Meduna Alexander, prof. RNDr., CSc.
English title
Parallel Deep Pushdown Automata
Language
Czech
Abstract

This thesis introduces parallel deep pushdown automata as the parallel version of the deep pushdown automata. They are based on the rules, where the automaton can expand n topmost non-terminals in only one derivation step if there are enough non-terminals on the pushdown. The main advantage rests in a fact, that parallel automaton can makde a decission faster.

Keywords

formal languages, automata, pushdown automata, deep pushdown automata, parallel deep pushdown automata, grammars, context-free grammars, n-limited state grammars, state grammars

Department
Degree Programme
Information Technology
Files
Status
defended, grade A
Date
12 June 2007
Reviewer
Committee
Meduna Alexander, prof. RNDr., CSc. (DIFS FIT BUT), předseda
Herout Pavel, doc. Ing., Ph.D. (WBU in Pilsen), člen
Lukáš Roman, Ing., Ph.D. (DIFS FIT BUT), člen
Růžička Richard, doc. Ing., Ph.D., MBA (DCSY FIT BUT), člen
Strnadel Josef, Ing., Ph.D. (DCSY FIT BUT), člen
Zbořil František, doc. Ing., Ph.D. (DITS FIT BUT), člen
Citation
SOLÁR, Peter. Paralelní hluboké zásobníkové automaty. Brno, 2007. Bachelor's Thesis. Brno University of Technology, Faculty of Information Technology. 2007-06-12. Supervised by Meduna Alexander. Available from: https://www.fit.vut.cz/study/thesis/4917/
BibTeX
@bachelorsthesis{FITBT4917,
    author = "Peter Sol\'{a}r",
    type = "Bachelor's thesis",
    title = "Paraleln\'{i} hlubok\'{e} z\'{a}sobn\'{i}kov\'{e} automaty",
    school = "Brno University of Technology, Faculty of Information Technology",
    year = 2007,
    location = "Brno, CZ",
    language = "czech",
    url = "https://www.fit.vut.cz/study/thesis/4917/"
}
Back to top