Department of Information Systems

Mathematical Foundations of Formal Language Theory
Reseach leader:Zemek Petr
Team leaders:Meduna Alexander, Vrábel Lukáš
Agency:FRVŠ MŠMT
Code:FR271/2012/G1
Start:2012
End:2012
Files: 
+Type Name Title Size Modified
iconPresentationsPrezentace12.2013-01-06 17:08:46
iconText.pdfStudijní Text768 KB2013-01-06 17:46:07
^ Select all
With selected:
Keywords:formal language theory, theoretical computer science, mathematics
Annotation:
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.

Publications

2012Meduna Alexander, Vrábel Lukáš, Zemek Petr: An Infinite Hierarchy of Language Families Resulting from Stateless Pushdown Automata with Limited Pushdown Alphabets, In: DCFS'12: 14th International Workshop on Descriptional Complexity of Formal Systems, Braga, PT, Springer, 2012, p. 236-243, ISBN 978-3-642-31622-7, ISSN 0302-9743
 Vrábel Lukáš: A New Normal Form for Programmed Grammars with Appearance Checking, In: Proceedings of the 18th Conference STUDENT EEICT 2012 Volume 3, Brno, CZ, VUT v Brně, 2012, p. 420-425, ISBN 978-80-214-4462-1
 Zemek Petr: Normal Forms of One-Sided Random Context Grammars, In: Proceedings of the 18th Conference STUDENT EEICT 2012 Volume 3, Brno, CZ, VUT v Brně, 2012, p. 430-434, ISBN 978-80-214-4462-1

Your IPv4 address: 54.234.126.92
Switch to IPv6 connection

DNSSEC [dnssec]