Thesis Details

Převody mezi regulárními gramatikami, regulárními výrazy a konečnými automaty

Master's Thesis Student: Podhorský Michal Academic Year: 2006/2007 Supervisor: Masopust Tomáš, RNDr., Ph.D.
English title
Mutual Transformations of Regular Grammars, Regular Expressions and Finite Automata
Language
Czech
Abstract

This work describes models of modern language theory - finite automata, regular grammars and regular expressions. A web application converting among these models is implemented.

Keywords

Formal Language Theory, Finite Automaton, Regular Grammar, Regular Expression, Web Application, Java, Java EE, JavaServer Pages, Apache Tomcat.

Department
Degree Programme
Information Technology, Field of Study Information Systems
Files
Status
defended, grade A
Date
21 June 2007
Reviewer
Committee
Češka Milan, prof. RNDr., CSc. (DITS FIT BUT), předseda
Ryšavý Ondřej, doc. Ing., Ph.D. (DIFS FIT BUT), člen
Sumec Stanislav, Ing., Ph.D. (DCGM FIT BUT), člen
Šafařík Jiří, prof. Ing., CSc. (WBU in Pilsen), člen
Zbořil František, doc. Ing., Ph.D. (DITS FIT BUT), člen
Zendulka Jaroslav, doc. Ing., CSc. (DIFS FIT BUT), člen
Citation
PODHORSKÝ, Michal. Převody mezi regulárními gramatikami, regulárními výrazy a konečnými automaty. Brno, 2007. Master's Thesis. Brno University of Technology, Faculty of Information Technology. 2007-06-21. Supervised by Masopust Tomáš. Available from: https://www.fit.vut.cz/study/thesis/3894/
BibTeX
@mastersthesis{FITMT3894,
    author = "Michal Podhorsk\'{y}",
    type = "Master's thesis",
    title = "P\v{r}evody mezi regul\'{a}rn\'{i}mi gramatikami, regul\'{a}rn\'{i}mi v\'{y}razy a kone\v{c}n\'{y}mi 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/3894/"
}
Back to top