Výzkumná skupina formálních modelů

Publikace

2014MEDUNA Alexander a ZEMEK Petr. Regulated Grammars and Automata. New York: Springer US, 2014. ISBN 978-1-4939-0368-9.
 MEDUNA Alexander a ZEMEK Petr. One-Sided Random Context Grammars with a Limited Number of Right Random Context Rules. Theoretical Computer Science. Paris: Elsevier Science, 2014, roč. 516, č. 1, s. 127-132. ISSN 0304-3975.
 MEDUNA Alexander. Formal Languages and Computation. New York: Taylor & Francis Informa plc, 2014. ISBN 978-1-4665-1345-7.
2013HORÁČEK Petr. Application Perspectives of Synchronous Matrix Grammars. In: Proceedings of the 19th Conference STUDENT EEICT 2013 Volume 3. Brno: Vysoké učení technické v Brně, 2013, s. 202-206. ISBN 978-80-214-4695-3.
 MEDUNA Alexander a ZEMEK Petr. Generalized One-Sided Forbidding Grammars. International Journal of Computer Mathematics. 2013, roč. 90, č. 2, s. 172-182. ISSN 0020-7160.
 MEDUNA Alexander a ZEMEK Petr. Left Random Context ET0L Grammars. Fundamenta Informaticae. Amsterdam: IOS Press, 2013, roč. 123, č. 3, s. 289-304. ISSN 0169-2968.
 MEDUNA Alexander a ZEMEK Petr. On the Generation of Sentences with Their Parses by Propagating Regular-Controlled Grammars. Theoretical Computer Science. Paris: Elsevier Science, 2013, roč. 477, č. 1, s. 67-75. ISSN 0304-3975.
 SOLÁR Peter. Deep Pushdown Transducers and Parallel Deep Pushdown Transducers. In: Proceedings of the 19th Conference STUDENT EEICT 2013 Volume 3. Brno: Vysoké učení technické v Brně, 2013, s. 207-211. ISBN 978-80-214-4695-3.
 VRÁBEL Lukáš. On Stateless Pushdown Automata And Limited Pushdown Alphabets. Vysoké učení technické v Brně, 2013.
 ZEMEK Petr. One-Sided Random Context Grammars: Established Results and Open Problems. In: Proceedings of the 19th Conference STUDENT EEICT 2013 Volume 3. Brno: Vysoké učení technické v Brně, 2013, s. 222-226. ISBN 978-80-214-4695-3.
2012HORÁČEK Petr a MEDUNA Alexander. Synchronous Versions of Regulated Grammars: Generative Power and Linguistic Applications. Theoretical and Applied Informatics. Varšava: 2012, roč. 24, č. 3, s. 175-190. ISSN 1896-5334.
 HORÁČEK Petr. On Generative Power of Synchronous Grammars with Linked Rules. In: Proceedings of the 18th Conference STUDENT EEICT 2012 Volume 3. Brno: Vysoké učení technické v Brně, 2012, s. 376-380. ISBN 978-80-214-4462-1.
 JIRÁK Ota. Memory Consumption of Classical and Lazy Scattered Context Grammar Parser. In: Proceedings of the 18th Conference STUDENT EEICT 2012 Volume 3. Brno: Vysoké učení technické v Brně, 2012, s. 381-385. ISBN 978-80-214-4462-1.
 KOUTNÝ Jiří a MEDUNA Alexander. Tree-Controlled Grammars with Restrictions Placed upon Cuts and Paths. Kybernetika. 2012, roč. 48, č. 1, s. 165-175. ISSN 0023-5954.
 KOUTNÝ Jiří. Grammars with Restricted Derivation Trees. Brno, 2012.
 KOUTNÝ Jiří. On Path-Controlled Grammars and Pseudoknots. In: Proceedings of the 18th Conference STUDENT EEICT 2012 Volume 3. Brno: Vysoké učení technické v Brně, 2012, s. 391-395. ISBN 978-80-214-4462-1.
 MEDUNA Alexander a ZEMEK Petr. Controlled Pure Grammar Systems. Journal of Universal Computer Science. 2012, roč. 18, č. 14, s. 2024-2040. ISSN 0948-6968.
 MEDUNA Alexander a ZEMEK Petr. Jumping Finite Automata. International Journal of Foundations of Computer Science. 2012, roč. 23, č. 7, s. 1555-1578. ISSN 0129-0541.
 MEDUNA Alexander a ZEMEK Petr. Nonterminal Complexity of One-Sided Random Context Grammars. Acta Informatica. 2012, roč. 49, č. 2, s. 55-68. ISSN 0001-5903.
 MEDUNA Alexander a ZEMEK Petr. One-Sided Forbidding Grammars and Selective Substitution Grammars. International Journal of Computer Mathematics. 2012, roč. 89, č. 5, s. 586-596. ISSN 0020-7160.
 MEDUNA Alexander a ZEMEK Petr. One-Sided Random Context Grammars with Leftmost Derivations. LNCS Festschrift Series: Languages Alive - Essays Dedicated to Jürgen Dassow on the Occasion of His 65th Birthday. Berlin-Heidelberg: Springer Verlag, 2012, s. 160-173. ISBN 978-3-642-31643-2.
 MEDUNA Alexander, VRÁBEL Lukáš a 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, s. 236-243. ISBN 978-3-642-31622-7. ISSN 0302-9743.
 SOLÁR Peter. Parallel deep pushdown automata. In: Proceedings of the 18th Conference STUDENT EEICT 2012. Brno: Vysoké učení technické v Brně, 2012, s. 410-414. ISBN 978-80-214-4462-1.
 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: Vysoké učení technické v Brně, 2012, s. 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: Vysoké učení technické v Brně, 2012, s. 430-434. ISBN 978-80-214-4462-1.
 ČERMÁK Martin, HORÁČEK Petr a MEDUNA Alexander. Rule-Restricted Automaton-Grammar Transducers: Power and Linguistic Applications. 8th Doctoral Workshop on Mathematical and Engineering Methods in Computer Science. Brno, 2012. ISBN 978-80-87342-15-2.
 ČERMÁK Martin, HORÁČEK Petr a MEDUNA Alexander. Rule-restricted automaton-grammar transducers: Power and linguistic applications. Mathematics for Applications. Brno: Ústav matematiky FEKT VUT v Brně, 2012, roč. 1, č. 1, s. 13-35. ISSN 1805-3610.
 ČERMÁK Martin, KOUTNÝ Jiří a MEDUNA Alexander. Parsing Based on n-Path Tree-Controlled Grammars. Theoretical and Applied Informatics. Varšava: 2012, roč. 2011, č. 23, s. 213-228. ISSN 1896-5334.
 ČERMÁK Martin. Formal Systems Based on Automata and Grammars. Brno, 2012.
 ČERMÁK Martin. Restrictions on Derivations in n-Generating Grammar Systems. In: Proceedings of the 18th Conference and Competition STUDENT EEICT 2012 Volume 5. Brno: Fakulta informačních technologií VUT v Brně, 2012, s. 371-375. ISBN 978-80-214-4462-1.
2011HORÁČEK Petr a MEDUNA Alexander. Regulated Rewriting in Natural Language Translation. In: 7th Doctoral Workshop on Mathematical and Engineering Methods in Computer Science. Brno: Vysoké učení technické v Brně, 2011, s. 35-42. ISBN 978-80-214-4305-1.
 HORÁČEK Petr. Parse Driven Translation. In: Proceedings of the 17th Conference and Competition STUDENT EEICT 2011 Volume 3. Brno: Fakulta informačních technologií VUT v Brně, 2011, s. 480-484. ISBN 978-80-214-4273-3.
 JIRÁK Ota a KOLÁŘ Dušan. Comparison of Classical and Lazy Approach in SCG Compiler. In: NUMERICAL ANALYSIS AND APPLIED MATHEMATICS ICNAAM 2011: International Conference on Numerical Analysis and Applied Mathematics. Halkidiki: American Institute of Physics, 2011, s. 873-876. ISBN 978-0-7354-0956-9. ISSN 1551-7616.
 JIRÁK Ota. Grammar-Based Malicious Code Detection Concept. In: Proceedings of the 17th Conference and Competition STUDENT EEICT 2011 Volume 3. Brno: Fakulta informačních technologií VUT v Brně, 2011, s. 5. ISBN 978-80-214-4273-3.
 KOUTNÝ Jiří, KŘIVKA Zbyněk a MEDUNA Alexander. Pumping Properties of Path-Restricted Tree-Controlled Languages. In: 7th Doctoral Workshop on Mathematical and Engineering Methods in Computer Science. Brno: Vysoké učení technické v Brně, 2011, s. 61-69. ISBN 978-80-214-4305-1.
 KOUTNÝ Jiří. Syntax Analysis of Tree-Controlled Languages. In: Proceedings of the 17th Conference STUDENT EEICT 2011 Volume 3. Brno: Vysoké učení technické v Brně, 2011, s. 5. ISBN 978-80-214-4273-3.
 KŘIVKA Zbyněk a MASOPUST Tomáš. Cooperating Distributed Grammar Systems with Random Context Grammars as Components. Acta Cybernetica. 2011, roč. 20, č. 2, s. 269-283. ISSN 0324-721X.
 KŘOUSTEK Jakub, ŽIDEK Stanislav, KOLÁŘ Dušan a MEDUNA Alexander. Scattered Context Grammars with Priority. International Journal of Advanced Research in Computer Science. Udaipur: International Journal of Advanced Research in Computer Science, 2011, roč. 2, č. 4, s. 1-6. ISSN 0976-5697.
 MEDUNA Alexander a ZEMEK Petr. One-Sided Random Context Grammars. Acta Informatica. 2011, roč. 48, č. 3, s. 149-163. ISSN 0001-5903.
 MEDUNA Alexander a ZEMEK Petr. Workspace Theorems for Regular-Controlled Grammars. Theoretical Computer Science. Paris: Elsevier Science, 2011, roč. 412, č. 35, s. 4604-4612. ISSN 0304-3975.
 MEDUNA Alexander a ŽIDEK Stanislav. Scattered Context Grammars Generating Sentences Followed by Derivation Trees. Theoretical and Applied Informatics. Varšava: 2011, roč. 2011, č. 2, s. 97-106. ISSN 1896-5334.
 MEDUNA Alexander, VRÁBEL Lukáš a ZEMEK Petr. LL Leftmost k-Linear Scattered Context Grammars. In: AIP Conference Proceedings. Kassandra, Halkidiki: American Institute of Physics, 2011, s. 833-836. ISBN 978-0-7354-0956-9. ISSN 1551-7616.
 MEDUNA Alexander, VRÁBEL Lukáš a ZEMEK Petr. On Nondeterminism in Programmed Grammars. In: 13th International Conference on Automata and Formal Languages. Debrecen: Computer and Automation Research Institute, Hungarian Academy of Sciences, 2011, s. 316-328. ISBN 978-615-5097-19-5.
 MEDUNA Alexander, ČERMÁK Martin a MASOPUST Tomáš. Some Power-Decreasing Derivation Restrictions in Grammar Systems. Schedae Informaticae. Krakov: 2011, roč. 2010, č. 19, s. 23-34. ISSN 0860-0295.
 PŘIKRYL Zdeněk, KŘOUSTEK Jakub, HRUŠKA Tomáš, KOLÁŘ Dušan, MASAŘÍK Karel a HUSÁR Adam. Design and Simulation of High Performance Parallel Architectures Using the ISAC Language. GSTF International Journal on Computing. Singapur: Global Science & Technology Forum, 2011, roč. 1, č. 2, s. 97-106. ISSN 2010-2283.
 VRÁBEL Lukáš. A New Normal Form for Programmed Grammars. In: Proceedings of the 17th Conference STUDENT EEICT 2011 Volume 3. Brno: Fakulta informačních technologií VUT v Brně, 2011, s. 5. ISBN 978-80-214-4273-3.
 ZEMEK Petr. On the Nonterminal Complexity of Left Random Context E0L Grammars. In: Proceedings of the 17th Conference STUDENT EEICT 2011 Volume 3. Brno: Fakulta informačních technologií VUT v Brně, 2011, s. 510-514. ISBN 978-80-214-4273-3.
 ČERMÁK Martin a MEDUNA Alexander. n-Accepting Restricted Pushdown Automata Systems. 7th Doctoral Workshop on Mathematical and Engineering Methods in Computer Science. Brno: Masarykova universita, 2011. ISBN 978-80-214-4305-1.
 ČERMÁK Martin a MEDUNA Alexander. n-Accepting Restricted Pushdown Automata Systems. In: 13th International Conference on Automata and Formal Languages. Nyíregyháza: Computer and Automation Research Institute, Hungarian Academy of Sciences, 2011, s. 168-183. ISBN 978-615-5097-19-5.
 ČERMÁK Martin. Basic Properties of n-Languages. In: Proceedings of the 17th Conference and Competition STUDENT EEICT 2011 Volume 3. Brno: Fakulta informačních technologií VUT v Brně, 2011, s. 460-464. ISBN 978-80-214-4273-3.
 ĎURFINA Lukáš, KŘOUSTEK Jakub, ZEMEK Petr, KOLÁŘ Dušan, HRUŠKA Tomáš, MASAŘÍK Karel a MEDUNA Alexander. Design of a Retargetable Decompiler for a Static Platform-Independent Malware Analysis. In: The 5th International Conference on Information Security and Assurance. Brno: Springer Verlag, 2011, s. 72-86. ISBN 978-3-642-23140-7.
 ĎURFINA Lukáš, KŘOUSTEK Jakub, ZEMEK Petr, KOLÁŘ Dušan, HRUŠKA Tomáš, MASAŘÍK Karel a MEDUNA Alexander. Design of a Retargetable Decompiler for a Static Platform-Independent Malware Analysis. In: 7th Doctoral Workshop on Mathematical and Engineering Methods in Computer Science. Brno: Masarykova universita, 2011, s. 114-114. ISBN 978-80-214-4305-1.
2010GOLDEFUS Filip, MASOPUST Tomáš a MEDUNA Alexander. Left-Forbidding Cooperating Distributed Grammar Systems. Theoretical Computer Science. Paris: Elsevier Science, 2010, roč. 40, č. 411, s. 3661-3667. ISSN 0304-3975.
 GOLDEFUS Filip. On Relations on Productions for Cooperative Distributed Grammar Systems. In: Proceedings of the 16th Conference Student EEICT 2010. Brno: Vysoké učení technické v Brně, 2010, s. 156-160. ISBN 978-80-214-4080-7.
 HORÁČEK Petr. Formal Models in Processing of Japanese Language. In: Proceedings of the 16th Conference and Competition STUDENT EEICT 2010 Volume 5. Brno: Fakulta informačních technologií VUT v Brně, 2010, s. 161-165. ISBN 978-80-214-4080-7.
 JIRÁK Ota a KŘIVKA Zbyněk. Hardware Design Tool based on Eclipse Modeling Framework. In: Proceedings of the 44th Spring International Conference Modeling and Simulation Systems. Ostrava: MARQ, 2010, s. 138-144. ISBN 978-80-86840-51-2.
 JIRÁK Ota. Table-Driven Parsing of Scattered Context Grammar. In: Proceedings of the 16th Conference Student EEICT 2010 Volume 5. Brno: Fakulta informačních technologií VUT v Brně, 2010, s. 171-175. ISBN 978-80-214-4080-7.
 KOLÁŘ Dušan a KVĚTOŇOVÁ Šárka. Comparison of Formal Models for Processes with Scattered Inter-Dependencies. In: Proceedings of The European Simulation and Modelling Conference - ESM'2010. Ghent: EUROSIS, 2010, s. 23-26. ISBN 978-90-77381-57-1.
 KOUTNÝ Jiří. On n-Path-Controlled Grammars. In: Proceedings of the 16th Conference STUDENT EEICT 2010 Volume 5. Brno: Vysoké učení technické v Brně, 2010, s. 176-180. ISBN 978-80-214-4080-7.
 KŘOUSTEK Jakub a ŽIDEK Stanislav. Generating Proper VLIW Assembler Code Using Scattered Context Grammars. In: Proceedings of the 16th Conference Student EEICT 2010 Volume 5. Brno: Fakulta informačních technologií VUT v Brně, 2010, s. 181-185. ISBN 978-80-214-4080-7.
 KŘOUSTEK Jakub, ŽIDEK Stanislav, KOLÁŘ Dušan a MEDUNA Alexander. Exploitation of Scattered Context Grammars to Model VLIW Instruction Constraints. In: Proceedings of the 12th Biennial Baltic Electronics Conference. Tallinn: Institute of Electrical and Electronics Engineers, 2010, s. 165-168. ISBN 978-1-4244-7357-1.
 LUKÁŠ Roman a MEDUNA Alexander. Multigenerative Grammar Systems and Matrix Grammars. Kybernetika. 2010, roč. 46, č. 1, s. 68-82. ISSN 0023-5954.
 MEDUNA Alexander a TECHET Jiří. Scattered Context Grammars and their Applications. WIT Press, UK: WIT Press, 2010. ISBN 978-1-84564-426-0.
 MEDUNA Alexander a ZEMEK Petr. Regulated Grammars and Their Transformations. Brno: Vysoké učení technické v Brně, 2010. ISBN 978-80-214-4203-0.
 PŘIKRYL Zdeněk, KŘOUSTEK Jakub, HRUŠKA Tomáš, KOLÁŘ Dušan, MASAŘÍK Karel a HUSÁR Adam. Design and Debugging of Parallel Architectures Using the ISAC Language. In: Proceedings ot the Annual International Conference on Advanced Distributed and Parallel Computing and Real-Time and Embedded Systems. Singapore: Global Science & Technology Forum, 2010, s. 213-221. ISBN 978-981-08-7656-2.
 ZEMEK Petr. On Erasing Rules in Regulated Grammars. Brno: Fakulta informačních technologií VUT v Brně, 2010.
 ZEMEK Petr. k-Limited Erasing Performed by Regular-Controlled Context-Free Grammars. In: Proceedings of the 16th Conference and Competition STUDENT EEICT 2010. Brno: Fakulta informačních technologií VUT v Brně, 2010, s. 42-44. ISBN 978-80-214-4078-4.
 ČERMÁK Martin. Multilanguages and Multiaccepting Automata System. In: Proceedings of the 16th Conference and Competition STUDENT EEICT 2010 Volume 5. Brno: Fakulta informačních technologií VUT v Brně, 2010, s. 146-150. ISBN 978-80-214-4080-7.
2009CSUHAJ-VARJÚ Erzsébet, MASOPUST Tomáš a VASZIL György. Cooperating Distributed Grammar Systems with Permitting Grammars as Components. Romanian Journal of Information Science and Technology (ROMJIST). Bukurest: Romanian Academy, Publishing House of the Romanian Academy, 2009, roč. 12, č. 2, s. 175-189. ISSN 1453-8245.
 GOLDEFUS Filip. Cooperating Distributed Grammar Systems and Graph Controlled Grammar Systems with Infinite Number of Components. In: Proceedings of the 15th Conference and Competition STUDENT EEICT 2009 Volume 4. Brno: Ústav informačních systémů FIT VUT v Brně, 2009, s. 400-4004. ISBN 978-80-214-3870-5.
 JIRÁK Ota a KOLÁŘ Dušan. Derivation in Scattered Context Grammar via Lazy Function Evaluation. In: 5th Doctoral Workshop on Mathematical and Engineering Methods in Computer Science. Brno: Masarykova universita, 2009, s. 118-125. ISBN 978-80-87342-04-6.
 JIRÁK Ota a KOLÁŘ Dušan. Derivation in Scattered Context Grammar via Lazy Function Evaluation. In: Annual Doctoral Workshop on Mathematical and Engineering Methods in Computer Science (MEMICS'09). Wadern: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, 2009, s. 10. ISBN 978-3-939897-15-6. ISSN 2190-6807.
 JIRÁK Ota a KŘIVKA Zbyněk. Simulation-based Debugging of 8-bit Softcore Processor. In: Proceedings of XXXIth International Autumn Colloquium Advanced Simulation of Systems. Ostrava: MARQ, 2009, s. 68-73. ISBN 978-80-86840-47-5.
 JIRÁK Ota. Delayed Execution of Scattered Context Grammar Rules. In: Proceedings of the 15th Conference and Competition STUDENT EEICT 2009 Volume 4. Brno: Fakulta informačních technologií VUT v Brně, 2009, s. 405-409. ISBN 978-80-214-3870-5.
 KOLÁŘ Dušan. Exploitation of Scattered Context Grammars to Model Constraints between Components. In: Proceedings of 31st Autumn International Colloqium ASIS 2009, Advanced Simulation of Systems. Ostrava: MARQ, 2009, s. 13-18. ISBN 978-80-86840-47-5.
 KOUTNÝ Jiří. Regular Paths in Derivation Trees of Context-free Grammars. In: Proceedings of the 15th Conference STUDENT EEICT 2009 Volume 4. Brno: Vysoké učení technické v Brně, 2009, s. 410-414. ISBN 978-80-214-3870-5.
 KVĚTOŇOVÁ Šárka a KOLÁŘ Dušan. Optimization of Car Repair Processes by Scattered Context Grammars Application. In: The 2009 European Simulation and Modelling Conference. Ghent: EUROSIS, 2009, s. 146-149. ISBN 978-90-77381-52-6.
 KŘIVKA Zbyněk a MASOPUST Tomáš. A Note on the Cooperation in Rewriting Systems with Context-Dependency Checking. In: 11th Italian Conference on Theoretical Computer Science. Cremona, 2009, s. 129-135.
 MASOPUST Tomáš a MEDUNA Alexander. Descriptional Complexity of Three-Nonterminal Scattered Context Grammars: An Improvement. In: Proceedings of 11th International Workshop on Descriptional Complexity of Formal Systems. Magdeburg: Otto-von-Guericke-Universität Magdeburg, 2009, s. 235-245. ISBN 978-3-940961-31-0.
 MASOPUST Tomáš a MEDUNA Alexander. On Pure Multi-Pushdown Automata that Perform Complete Pushdown Pops. Acta Cybernetica. 2009, roč. 19, č. 2, s. 537-552. ISSN 0324-721X.
 MASOPUST Tomáš a MEDUNA Alexander. On context-free rewriting with a simple restriction and its computational completeness. RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications. Les Ulis: EDP Sciences, 2009, roč. 43, č. 2, s. 365-378. ISSN 0988-3754.
 MASOPUST Tomáš. A Note on the Generative Power of Some Simple Variants of Context-Free Grammars Regulated by Context Conditions. In: LATA 2009 proceedings. Springer-Verlag Berlin Heidelberg: Springer Verlag, 2009, s. 554-565. ISBN 978-3-642-00981-5. ISSN 0302-9743.
 MASOPUST Tomáš. On the Descriptional Complexity of Scattered Context Grammars. Theoretical Computer Science. Paris: Elsevier Science, 2009, roč. 410, č. 1, s. 108-112. ISSN 0304-3975.
 MASOPUST Tomáš. On the Terminating Derivation Mode in Cooperating Distributed Grammar Systems with Forbidding Components. International Journal of Foundations of Computer Science. 2009, roč. 20, č. 2, s. 331-340. ISSN 0129-0541.
 MASOPUST Tomáš. Regulated Nondeterminism in PDAs: The Non-Regular Case. In: Proceedings of Workshop on Non-Classical Models of Automata and Applications (NCMA). Wroclaw: Osterreichische Computer Gesellschaft, 2009, s. 181-194. ISBN 978-3-85403-256-4.
 MEDUNA Alexander a TECHET Jiří. An Infinite Hierarchy of Language Families Generated by Scattered Context Grammars with n-Limited Derivations. Theoretical Computer Science. Paris: Elsevier Science, 2009, roč. 410, č. 21, s. 1961-1969. ISSN 0304-3975.
 RYCHNOVSKÝ Lukáš. Regulated Pushdown Automata Revisited. In: Proceedings of the 15th Conference STUDENT EEICT 2009. Brno: Fakulta informačních technologií VUT v Brně, 2009, s. 440-444. ISBN 978-80-214-3870-5.
 ČERMÁK Martin. Power Decreasing Derivation Restriction in Grammar Systems. In: Proceedings of the 15th Conference and Competition STUDENT EEICT 2009 Volume 4. Brno: Fakulta informačních technologií VUT v Brně, 2009, s. 385-389. ISBN 978-80-214-3870-5.

Zobrazit všechny publikace

Disertační a habilitační práce

2012KOUTNÝ Jiří. Grammars with Restricted Derivation Trees. Brno, 2012.
 ČERMÁK Martin. Formal Systems Based on Automata and Grammars. Brno, 2012.
2008TECHET Jiří. Scattered Context in Formal Languages. Brno: Fakulta informačních technologií VUT v Brně, 2008.
2007KŘIVKA Zbyněk. Přepisující systémy s omezenými konfiguracemi. Brno, 2007.
 MASOPUST Tomáš. Regulated Formal Models and Their Reduction. Brno, 2007.

Vaše IPv4 adresa: 54.204.68.109
Přepnout na IPv6 spojení

DNSSEC [dnssec]