Project Details
Matematické základy teorie formálních jazyků
Project Period: 1. 1. 2012 – 31. 12. 2012
Project Type: grant
Code: FR271/2012/G1
Agency: Ministerstvo školství, mládeže a tělovýchovy ČR
Program: Fond rozvoje vysokých škol (FRVŠ)
formal language theory, theoretical computer science, mathematics
The purpose of this project was to create study materials to guide students
through the mathematical foundations of formal language theory. These materials
demonstrate the usefulness of mathematical notation a rigorous methods. The
project emphasises explanations based on several areas which computer science
students know very well, such as programming languages.
Meduna Alexandr, prof. RNDr., CSc. (DIFS)
Vrábel Lukáš, Ing.
- DIR ..
- pdf P01-Sets.pdf 220 kB
- pdf P02-Sequences-Relations-Functions.pdf 167 kB
- pdf P03-Finite-Automata.pdf 156 kB
- pdf P04-Closures.pdf 131 kB
- pdf P05-Statements-Proofs.pdf 165 kB
- pdf PB01-Jumping-Finite-Automata.pdf 552 kB
- pdf PB02-Nondeterminism-in-PGs.pdf 161 kB
- pdf PB03-Szilard-Languages.pdf 217 kB
- pdf PB04-Workspace-Theorems-For-rCGs.pdf 364 kB
- pdf PB05-Converting-FAs-To-REs.pdf 217 kB
- pdf PB06-Lookahead-In-Translators.pdf 179 kB
- pdf PB07-One-Sided-RCG.pdf 232 kB
2012
- MEDUNA, A.; VRÁBEL, L.; ZEMEK, P. An Infinite Hierarchy of Language Families Resulting from Stateless Pushdown Automata with Limited Pushdown Alphabets. DCFS'12: 14th International Workshop on Descriptional Complexity of Formal Systems. Lecture Notes in Computer Science. Lecture Notes in Computer Science. Braga: Springer Verlag, 2012.
p. 236-243. ISBN: 978-3-642-31622-7. ISSN: 0302-9743. Detail - VRÁBEL, L. A New Normal Form for Programmed Grammars with Appearance Checking. Proceedings of the 18th Conference STUDENT EEICT 2012 Volume 3. Brno: Brno University of Technology, 2012.
p. 420-425. ISBN: 978-80-214-4462-1. Detail - ZEMEK, P. Normal Forms of One-Sided Random Context Grammars. Proceedings of the 18th Conference STUDENT EEICT 2012 Volume 3. Brno: Brno University of Technology, 2012.
p. 430-434. ISBN: 978-80-214-4462-1. Detail