Mathematical Foundations of Formal Language Theory

Czech title:Matematické základy teorie formálních jazyků
Reseach leader:Zemek Petr
Team leaders:Meduna Alexander, Vrábel Lukáš
Agency:Fond rozvoje vysokých škol MŠMT
Code:FR271/2012/G1
Start:2012-01-01
End:2012-12-31
Files: 
+Type Name Title Size Last modified
iconPresentationsPresentations12.2013-01-06 17:08:46
iconText.pdfText768 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áš and 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: Springer Verlag, 2012, pp. 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: Brno University of Technology, 2012, pp. 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: Brno University of Technology, 2012, pp. 430-434. ISBN 978-80-214-4462-1.

Your IPv4 address: 54.161.116.225
Switch to IPv6 connection

DNSSEC [dnssec]