Formal Model Research Group

2024

ANNA, P.; RYDLO, Š.; BALÁŽ, T.; KOLÁŘ, D.; NOVÁČKOVÁ, K. Detection of Laser Beams Aimed at Aircraft in Flight. 2024 New Trends in Civil Aviation (NTCA). Praha: 2024. p. 119-124. ISBN: 978-80-01-07182-3. Detail

MEDUNA, A.; KŘIVKA, Z. Jumping Computation: Updating Automata and Grammars for Discontinuous Information Processing. Boca Raton: CRC Press LLC, 2024. 293 p. ISBN: 978-0-367-62093-6. Detail

2023

KOŽÁR, T.; MEDUNA, A. Automata: Theory, Trends, And Applications. Singapore: World Scientific Publishing Co Pte Ltd, 2023. 436 p. ISBN: 978-981-1278-12-9. Detail

KOŽÁR, T.; MEDUNA, A.; KŘIVKA, Z. Final sentential forms. In Proceedings 13th International Workshop on Non-Classical Models of Automata and Applications. Electronic Proceedings in Theoretical Computer Science, EPTCS. Famagusta: School of Computer Science and Engineering, University of New South Wales, 2023. p. 38-47. ISSN: 2075-2180. Detail

REGÉCIOVÁ, D.; KOLÁŘ, D. GenRex: Leveraging Regular Expressions for Dynamic Malware Detection. IEEE Xplore. Exeter: Institute of Electrical and Electronics Engineers, 2023. p. 857-864. ISBN: 979-8-3503-8199-3. Detail

2022

HAMMER, J.; KŘIVKA, Z. Practical Aspects of Membership Problem of Watson-Crick Context-free Grammars. In Proceedings 12th International Workshop on Non-Classical Models of Automata and Applications. Electronic Proceedings in Theoretical Computer Science, EPTCS. Debrecen: School of Computer Science and Engineering, University of New South Wales, 2022. p. 88-111. ISSN: 2075-2180. Detail

HAVEL, M.; MEDUNA, A. On Elimination of Erasing Rules from E0S Grammars. Computer Science Journal of Moldova, 2022, vol. 30, no. 2, p. 135-147. ISSN: 1561-4042. Detail

KLOBUČNÍKOVÁ, D.; KŘIVKA, Z.; MEDUNA, A. Conclusive Tree-Controlled Grammars. In Proceedings 12th International Workshop on Non-Classical Models of Automata and Applications. Electronic Proceedings in Theoretical Computer Science, EPTCS. Debrecen: School of Computer Science and Engineering, University of New South Wales, 2022. p. 112-125. ISSN: 2075-2180. Detail

KOCMAN, R.; KŘIVKA, Z.; MEDUNA, A.; NAGY, B. A Jumping 5'->3' Watson-Crick Finite Automata Model. Acta Informatica, 2022, vol. 59, no. 5, p. 557-584. ISSN: 0001-5903. Detail

MARTIŠKO, J.; KŘIVKA, Z.; MEDUNA, A. CD Grammar Systems with Two Propagating Scattered Context Components Characterize the Family of Context Sensitive Languages. International Journal of Foundations of Computer Science, 2022, vol. 33, no. 03, p. 335-348. ISSN: 0129-0541. Detail

2021

KÖVÁRI, A.; KŘIVKA, Z.; MEDUNA, A. Burden-free parallel programming on GraalVM with Yona. Springer's Lecture Notes in Computer Science. Advanced Research in Computing and Software Science. Bolzano: 2021. p. 0-0. Detail

KÖVÁRI, A.; KŘIVKA, Z.; MEDUNA, A. Evaluating Yona Language. In INTERNATIONAL CONFERENCES ON WWW/INTERNET 2021 AND APPLIED COMPUTING 2021. Lisabon: International Association for Development of the Information Society, 2021. p. 101-108. ISBN: 978-989-8704-34-4. Detail

KŘIVKA, Z.; MEDUNA, A. Scattered Context Grammars with One Non-Context-Free Production are Computationally Complete. Fundamenta Informaticae, 2021, vol. 179, no. 4, p. 361-384. ISSN: 0169-2968. Detail

2020

BARTÍK, V.; KOCMAN, R.; VOLF, T.; ZENDULKA, J. Architektura systému, ViAn Server, Snímací uzel a ViAn GUI. Brno: 2020. s. 0-0. Detail

KOCMAN, R.; KŘIVKA, Z.; MEDUNA, A. General CD Grammar Systems and Their Simplification. Journal of Automata, Languages and Combinatorics, 2020, vol. 25, no. 1, p. 37-54. ISSN: 1430-189X. Detail

MEDUNA, A.; HORÁČEK, P.; TOMKO, M. Handbook of Mathematical Models for Languages and Computation. Stevenage, United Kingdom: The Institution of Engineering and Technology, 2020. 750 p. ISBN: 978-1-78561-659-4. Detail

2019

MEDUNA, A.; KRČMÁŘ, R.; KÖVÁRI, A.; BENÍČKOVÁ, Z. On Operations over Language Families. Computer Science Journal of Moldova, 2019, vol. 27, no. 3, p. 255-282. ISSN: 1561-4042. Detail

MEDUNA, A.; KŘIVKA, Z.; KUČERA, J. Jumping Pure Grammars. COMPUTER JOURNAL, 2019, vol. 62, no. 1, p. 30-41. ISSN: 0010-4620. Detail

2018

CHARVÁT, L.; MEDUNA, A. A Reduction of Finitely Expandable Deep Pushdown Automata. Schedae Informaticae, 2018, vol. 2017, no. 26, p. 61-68. ISSN: 0860-0295. Detail

CHARVÁT, L.; MEDUNA, A. Internally Expandable Pushdown Automata and Their Computational Completeness. Romanian Journal of Information Science and Technology (ROMJIST), 2018, vol. 21, no. 3, p. 232-237. ISSN: 1453-8245. Detail

KOCMAN, R.; KŘIVKA, Z.; MEDUNA, A. On Double-Jumping Finite Automata and Their Closure Properties. RAIRO-THEORETICAL INFORMATICS AND APPLICATIONS, 2018, vol. 52, no. 2, p. 185-199. ISSN: 0988-3754. Detail

KOCMAN, R.; NAGY, B.; KŘIVKA, Z.; MEDUNA, A. A Jumping 5'->3' Watson-Crick Finite Automata Model. Tenth Workshop on Non-Classical Models of Automata and Applications (NCMA 2018). books@ocg.at 332. Wien: Austrian Computer Society, 2018. p. 117-132. ISBN: 978-3-903035-21-8. Detail

KUČERA, J.; KŘIVKA, Z.; MEDUNA, A. On k#$-Rewriting Systems. Romanian Journal of Information Science and Technology (ROMJIST), 2018, vol. 21, no. 3, p. 278-287. ISSN: 1453-8245. Detail

ZENDULKA, J.; BIELIKOVÁ, M.; BURGET, R.; KŘIVKA, Z. Data a Znalosti & WIKT 2018. Brno: Vysoké učení technické v Brně, 2018. s. 1-291. ISBN: 978-80-214-5679-2. Detail

2017

CHARVÁT, L.; MEDUNA, A. A Reduction of Finitely Expandable Deep Pushdown Automata. Proceedings 12th Doctoral Workshop on Mathematical and Engineering Methods in Computer Science (MEMICS 2017). Electronic Proceedings in Theoretical Computer Science. Telč: 2017. p. 1 (1 s.). Detail

KOCMAN, R.; KŘIVKA, Z.; MEDUNA, A. Rule-Homogeneous CD Grammar Systems. AFL 2017. Debrecen: 2017. p. 0-0. Detail

KŘIVKA, Z. Introduction to Graph Algorithms for Shortest-Paths Problems. 2017. p. 41-48. ISSN: 2386-866X. Detail

MEDUNA, A.; MARTIŠKO, J. CD Grammar Systems with Two Propagating Scattered Context Components Characterize the Family of Context Sensitive Languages. In 15th International Conference on Automata and Formal Languages. Electronic Proceedings in Theoretical Computer Science, EPTCS. Debrecen: Open Publishing Association, 2017. p. 170-179. ISSN: 2075-2180. Detail

MEDUNA, A.; SOUKUP, O. Modern Language Models and Computation: Theory with Applications. New York: Springer US, 2017. 567 p. ISBN: 978-3-319-63099-1. Detail

MEDUNA, A.; SOUKUP, O. Jumping Scattered Context Grammars. Fundamenta Informaticae, 2017, vol. 152, no. 1, p. 51-86. ISSN: 0169-2968. Detail

MEDUNA, A.; SOUKUP, O.; CSUHAJ-VARJÚ, E. On Tree-Restricted Regular-Controlled Context-Free Grammars. International Journal of Computer Mathematics: Computer Systems Theory, 2017, vol. 2, no. 4, p. 147-163. ISSN: 2379-9927. Detail

MILKOVIČ, M. Extraction of Information from .NET Executable Files. Sborník příspěvků Mezinárodní Masarykovy konference pro doktorandy a mladé vědecké pracovníky 2017. Hradec Králové: Akademické sdružení MAGNANIMITAS Assn., 2017. p. 1-9. ISBN: 978-80-87952-22-1. Detail

2016

KOCMAN, R.; KŘIVKA, Z.; MEDUNA, A. On Double-Jumping Finite Automata. Eighth Workshop on Non-Classical Models of Automata and Applications (NCMA 2016). books@ocg.at 321. Wien: Austrian Computer Society, 2016. p. 195-210. ISBN: 978-3-903035-10-2. Detail

KOCMAN, R.; MEDUNA, A. On Parallel Versions of Jumping Finite Automata. In Proceedings of the 2015 Federated Conference on Software Development and Object Technologies. Advances in Intelligent Systems and Computing. Cham: Springer International Publishing, 2016. p. 142-149. ISBN: 978-3-319-46534-0. Detail

KŘIVKA, Z.; MEDUNA, A.; ZEMEK, P. Phrase-Structure Grammars: Normal Forms and Reduction. COMPUTER JOURNAL, 2016, vol. 59, no. 8, p. 1180-1185. ISSN: 0010-4620. Detail

KUČERA, J.; MEDUNA, A. On State-Synchronized Automata Systems. Schedae Informaticae, 2016, vol. 2015, no. 24, p. 221-237. ISSN: 0860-0295. Detail

MEDUNA, A.; SOUKUP, O. Simple Matrix Grammars and Their Leftmost Variants. International Journal of Foundations of Computer Science, 2016, vol. 27, no. 3, p. 359-373. ISSN: 0129-0541. Detail

2015

KŘIVKA, Z.; MEDUNA, A. Jumping Grammars. International Journal of Foundations of Computer Science, 2015, vol. 26, no. 6, p. 709-731. ISSN: 0129-0541. Detail

MEDUNA, A.; KUČERA, J.; SOUKUP, O. Absolutely Unlimited Deep Pushdown Automata. Proceedings of the 10th Doctoral Workshop on Mathematical and Engineering Methods in Computer Science (MEMICS 2015). Telč: Ing. Vladislav Pokorný - Litera, 2015. p. 36-44. ISBN: 978-80-214-5254-1. Detail

MEDUNA, A.; SOUKUP, O.; ZEMEK, P. Ordered Pure Multi-Pushdown Automata. Theoretical and Applied Informatics, 2015, vol. 27, no. 1, p. 25-47. ISSN: 1896-5334. Detail

2014

HORÁČEK, P.; MEDUNA, A. New Grammar Systems and Their Application Perspectives. Schedae Informaticae, 2014, vol. 2013, no. 22, p. 47-68. ISSN: 0860-0295. Detail

KOUTNÝ, J.; MEDUNA, A. On Normal Forms and Erasing Rules in Path-Controlled Grammars. Schedae Informaticae, 2014, vol. 2013, no. 22, p. 9-18. ISSN: 0860-0295. Detail

KŘIVKA, Z.; SUBRAMANIAN, K.; MARTÍN-VIDE, C.; MEDUNA, A. A Variant of Pure Two-dimensional Context-free Grammars generating Picture Languages. In 16th International Workshop on Combinatorial Image Analysis. Lecture Notes in Computer Science. Lecture Notes in Computer Science, ISSN 0302-9743, Vol. 8466. Brno: Springer Verlag, 2014. p. 123-133. ISBN: 978-3-319-07147-3. ISSN: 0302-9743. Detail

KUČERA, J. On Determinism in State-Synchronized Automata Systems. Proceedings of the 20th Conference STUDENT EEICT 2014. Volume 3. Brno: Brno University of Technology, 2014. p. 259-263. ISBN: 978-80-214-4924-4. Detail

MEDUNA, A. Formal Languages and Computation. Taylor and Francis. Taylor and Francis. New York: Taylor & Francis Informa plc, 2014. 315 p. ISBN: 978-1-4665-1345-7. Detail

MEDUNA, A.; SOUKUP, O. Computational Completeness Resulting from Scattered Context Grammars Working Under Various Derivation Modes. Proceedings of MEMICS'14. Brno: NOVPRESS s.r.o., 2014. p. 89-100. ISBN: 978-80-214-5022-6. Detail

MEDUNA, A.; VRÁBEL, L.; ZEMEK, P. Solutions To Four Open Problems Concerning Controlled Pure Grammar Systems. International Journal of Computer Mathematics, 2014, vol. 91, no. 6, p. 1156-1169. ISSN: 0020-7160. Detail

MEDUNA, A.; ZEMEK, P. Regulated Grammars and Automata. New York: Springer US, 2014. 694 p. ISBN: 978-1-4939-0368-9. Detail

MEDUNA, A.; ZEMEK, P. Controlled Finite Automata. Acta Informatica, 2014, vol. 51, no. 5, p. 327-337. ISSN: 0001-5903. Detail

MEDUNA, A.; ZEMEK, P. One-Sided Random Context Grammars with a Limited Number of Right Random Context Rules. Theoretical Computer Science, 2014, vol. 516, no. 1, p. 127-132. ISSN: 0304-3975. Detail

MEDUNA, A.; ZEMEK, P. One-Sided Random Context Grammars: A Survey. In Computing with New Resources. Berlin: Springer Verlag, 2014. p. 338-351. ISBN: 978-3-319-13349-2. Detail

SOLÁR, P. Deep Pushdown Transducers and State Translation Schemes. Proceedings of the 20th Conference STUDENT EEICT 2014 Volume 3. Brno: Brno University of Technology, 2014. p. 264-268. ISBN: 978-80-214-4924-4. Detail

2013

MEDUNA, A.; ZEMEK, P. Generalized One-Sided Forbidding Grammars. International Journal of Computer Mathematics, 2013, vol. 90, no. 2, p. 172-182. ISSN: 0020-7160. Detail

MEDUNA, A.; ZEMEK, P. Left Random Context ET0L Grammars. Fundamenta Informaticae, 2013, vol. 123, no. 3, p. 289-304. ISSN: 0169-2968. Detail

MEDUNA, A.; ZEMEK, P. On the Generation of Sentences with Their Parses by Propagating Regular-Controlled Grammars. Theoretical Computer Science, 2013, vol. 477, no. 1, p. 67-75. ISSN: 0304-3975. Detail

SOLÁR, P. Deep Pushdown Transducers and Parallel Deep Pushdown Transducers. Proceedings of the 19th Conference STUDENT EEICT 2013 Volume 3. Brno: Brno University of Technology, 2013. p. 207-211. ISBN: 978-80-214-4695-3. Detail

2012

HORÁČEK, P.; MEDUNA, A. Synchronous Versions of Regulated Grammars: Generative Power and Linguistic Applications. Theoretical and Applied Informatics, 2012, vol. 24, no. 3, p. 175-190. ISSN: 1896-5334. Detail

KOUTNÝ, J.; MEDUNA, A. Tree-controlled Grammars with Restrictions Placed upon Cuts and Paths. Kybernetika, 2012, vol. 48, no. 1, p. 165-175. ISSN: 0023-5954. Detail

MEDUNA, A.; ČERMÁK, M.; HORÁČEK, P. Rule-restricted automaton-grammar transducers: Power and linguistic applications. Mathematics for applications, 2012, vol. 1, no. 1, p. 13-35. ISSN: 1805-3610. Detail

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

MEDUNA, A.; ZEMEK, P. Controlled Pure Grammar Systems. Journal of Universal Computer Science, 2012, vol. 18, no. 14, p. 2024-2040. ISSN: 0948-6968. Detail

MEDUNA, A.; ZEMEK, P. Jumping Finite Automata. International Journal of Foundations of Computer Science, 2012, vol. 23, no. 7, p. 1555-1578. ISSN: 0129-0541. Detail

MEDUNA, A.; ZEMEK, P. Nonterminal Complexity of One-Sided Random Context Grammars. Acta Informatica, 2012, vol. 49, no. 2, p. 55-68. ISSN: 0001-5903. Detail

MEDUNA, A.; ZEMEK, P. One-Sided Forbidding Grammars and Selective Substitution Grammars. International Journal of Computer Mathematics, 2012, vol. 89, no. 5, p. 586-596. ISSN: 0020-7160. Detail

MEDUNA, A.; ZEMEK, P. One-Sided Random Context Grammars with Leftmost Derivations. In LNCS Festschrift Series: Languages Alive - Essays Dedicated to Jürgen Dassow on the Occasion of His 65th Birthday. Berlin-Heidelberg: Springer Verlag, 2012. p. 160-173. ISBN: 978-3-642-31643-2. Detail

2011

ČERMÁK, M. Basic Properties of n-Languages. Proceedings of the 17th Conference and Competition STUDENT EEICT 2011 Volume 3. Brno: Faculty of Information Technology BUT, 2011. p. 460-464. ISBN: 978-80-214-4273-3. Detail

ČERMÁK, M.; KOUTNÝ, J.; MEDUNA, A. Parsing Based on n-Path Tree-Controlled Grammars. Theoretical and Applied Informatics, 2011, vol. 23, no. 3, p. 213-228. ISSN: 1896-5334. Detail

ČERMÁK, M.; MEDUNA, A. n-Accepting Restricted Pushdown Automata Systems. 13th International Conference on Automata and Formal Languages. Nyíregyháza: Computer and Automation Research Institute, Hungarian Academy of Sciences, 2011. p. 168-183. ISBN: 978-615-5097-19-5. Detail

ĎURFINA, L.; KŘOUSTEK, J.; ZEMEK, P.; KOLÁŘ, D.; HRUŠKA, T.; MASAŘÍK, K.; MEDUNA, A. Design of a Retargetable Decompiler for a Static Platform-Independent Malware Analysis. 7th Doctoral Workshop on Mathematical and Engineering Methods in Computer Science. Brno: Masaryk University, 2011. p. 114-114. ISBN: 978-80-214-4305-1. Detail

ĎURFINA, L.; KŘOUSTEK, J.; ZEMEK, P.; KOLÁŘ, D.; HRUŠKA, T.; MASAŘÍK, K.; MEDUNA, A. Design of a Retargetable Decompiler for a Static Platform-Independent Malware Analysis. The 5th International Conference on Information Security and Assurance. Communications in Computer and Information Science, Volume 200. Brno: Springer Verlag, 2011. p. 72-86. ISBN: 978-3-642-23140-7. Detail

HORÁČEK, P. Parse Driven Translation. Proceedings of the 17th Conference and Competition STUDENT EEICT 2011 Volume 3. Brno: Faculty of Information Technology BUT, 2011. p. 480-484. ISBN: 978-80-214-4273-3. Detail

HORÁČEK, P.; MEDUNA, A. Regulated Rewriting in Natural Language Translation. 7th Doctoral Workshop on Mathematical and Engineering Methods in Computer Science. Brno: Brno University of Technology, 2011. p. 35-42. ISBN: 978-80-214-4305-1. Detail

JIRÁK, O. Grammar-Based Malicious Code Detection Concept. Proceedings of the 17th Conference and Competition STUDENT EEICT 2011 Volume 3. Brno: Faculty of Information Technology BUT, 2011. p. 485-489. ISBN: 978-80-214-4273-3. Detail

JIRÁK, O.; KOLÁŘ, D. Comparison of Classical and Lazy Approach in SCG Compiler. NUMERICAL ANALYSIS AND APPLIED MATHEMATICS ICNAAM 2011: International Conference on Numerical Analysis and Applied Mathematics. AIP Conference Proceedings. Halkidiki: American Institute of Physics, 2011. p. 873-876. ISBN: 978-0-7354-0956-9. ISSN: 1551-7616. Detail

KOUTNÝ, J. Syntax Analysis of Tree-Controlled Languages. Proceedings of the 17th Conference STUDENT EEICT 2011 Volume 3. Brno: Brno University of Technology, 2011. p. 490-494. ISBN: 978-80-214-4273-3. Detail

KOUTNÝ, J.; KŘIVKA, Z.; MEDUNA, A. Pumping Properties of Path-Restricted Tree-Controlled Languages. 7th Doctoral Workshop on Mathematical and Engineering Methods in Computer Science. Brno: Brno University of Technology, 2011. p. 61-69. ISBN: 978-80-214-4305-1. Detail

KŘIVKA, Z.; MASOPUST, T. Cooperating Distributed Grammar Systems with Random Context Grammars as Components. Acta Cybernetica, 2011, vol. 20, no. 2, p. 269-283. ISSN: 0324-721X. Detail

KŘOUSTEK, J.; ŽIDEK, S.; KOLÁŘ, D.; MEDUNA, A. Scattered Context Grammars with Priority. International Journal of Advanced Research in Computer Science, 2011, vol. 2, no. 4, p. 1-6. ISSN: 0976-5697. Detail

MEDUNA, A.; ČERMÁK, M.; MASOPUST, T. Some Power-Decreasing Derivation Restrictions in Grammar Systems. Schedae Informaticae, 2011, vol. 2010, no. 19, p. 23-34. ISSN: 0860-0295. Detail

MEDUNA, A.; VRÁBEL, L.; ZEMEK, P. On Nondeterminism in Programmed Grammars. 13th International Conference on Automata and Formal Languages. Debrecen: Computer and Automation Research Institute, Hungarian Academy of Sciences, 2011. p. 316-328. ISBN: 978-615-5097-19-5. Detail

MEDUNA, A.; ZEMEK, P. One-Sided Random Context Grammars. Acta Informatica, 2011, vol. 48, no. 3, p. 149-163. ISSN: 0001-5903. Detail

MEDUNA, A.; ZEMEK, P. Workspace Theorems for Regular-Controlled Grammars. Theoretical Computer Science, 2011, vol. 412, no. 35, p. 4604-4612. ISSN: 0304-3975. Detail

PŘIKRYL, Z.; KŘOUSTEK, J.; HRUŠKA, T.; KOLÁŘ, D.; MASAŘÍK, K.; HUSÁR, A. Design and Simulation of High Performance Parallel Architectures Using the ISAC Language. GSTF International Journal on Computing, 2011, vol. 1, no. 2, p. 97-106. ISSN: 2010-2283. Detail

SOLÁR, P.; MEDUNA, A. Parallel deep pushdown automata. 2011. p. 0-0. Detail

VRÁBEL, L. A New Normal Form for Programmed Grammars. Proceedings of the 17th Conference STUDENT EEICT 2011 Volume 3. Brno: Faculty of Information Technology BUT, 2011. p. 500-504. ISBN: 978-80-214-4273-3. Detail

ZEMEK, P. On the Nonterminal Complexity of Left Random Context E0L Grammars. Proceedings of the 17th Conference STUDENT EEICT 2011 Volume 3. Brno: Faculty of Information Technology BUT, 2011. p. 510-514. ISBN: 978-80-214-4273-3. Detail

ZEMEK, P.; MEDUNA, A.; VRÁBEL, L. LL Leftmost k-Linear Scattered Context Grammars. AIP Conference Proceedings. AIP Conference Proceedings. Kassandra, Halkidiki: American Institute of Physics, 2011. p. 833-836. ISBN: 978-0-7354-0956-9. ISSN: 1551-7616. Detail

ŽIDEK, S. Scattered Context Grammars Generating Derivation Trees. Proceedings of the 17th Conference and Competition STUDENT EEICT 2011 Volume 3. Brno: Faculty of Information Technology BUT, 2011. p. 515-519. ISBN: 978-80-214-4273-3. Detail

ŽIDEK, S.; MEDUNA, A. Scattered Context Grammars Generating Sentences Followed by Derivation Trees. Theoretical and Applied Informatics, 2011, vol. 23, no. 2, p. 97-106. ISSN: 1896-5334. Detail

2010

ČERMÁK, M. Multilanguages and Multiaccepting Automata System. Proceedings of the 16th Conference and Competition STUDENT EEICT 2010 Volume 5. Brno: Faculty of Information Technology BUT, 2010. p. 146-150. ISBN: 978-80-214-4080-7. Detail

GOLDEFUS, F. On Relations on Productions for Cooperative Distributed Grammar Systems. Proceedings of the 16th Conference Student EEICT 2010. Volume 5. Brno: Brno University of Technology, 2010. p. 156-160. ISBN: 978-80-214-4080-7. Detail

HORÁČEK, P. Formal Models in Processing of Japanese Language. Proceedings of the 16th Conference and Competition STUDENT EEICT 2010 Volume 5. Brno: Faculty of Information Technology BUT, 2010. p. 161-165. ISBN: 978-80-214-4080-7. Detail

JIRÁK, O. Table-Driven Parsing of Scattered Context Grammar. Proceedings of the 16th Conference Student EEICT 2010 Volume 5. Brno: Faculty of Information Technology BUT, 2010. p. 171-175. ISBN: 978-80-214-4080-7. Detail

JIRÁK, O.; KŘIVKA, Z. Hardware Design Tool based on Eclipse Modeling Framework. Proceedings of the 44th Spring International Conference Modeling and Simulation Systems. Ostrava: 2010. p. 138-144. ISBN: 978-80-86840-51-2. Detail

KOLÁŘ, D.; KVĚTOŇOVÁ, Š. COMPARISON OF FORMAL MODELS FOR PROCESSES WITH SCATTERED INTER-DEPENDENCIES. Proceedings of The European Simulation and Modelling Conference - ESM'2010. Ghent: EUROSIS, 2010. p. 23-26. ISBN: 978-90-77381-57-1. Detail

KOUTNÝ, J. On n-Path-Controlled Grammars. Proceedings of the 16th Conference STUDENT EEICT 2010 Volume 5. Brno: Brno University of Technology, 2010. p. 176-180. ISBN: 978-80-214-4080-7. Detail

KŘOUSTEK, J.; ŽIDEK, S. Generating Proper VLIW Assembler Code Using Scattered Context Grammars. Proceedings of the 16th Conference Student EEICT 2010 Volume 5. Brno: Faculty of Information Technology BUT, 2010. p. 181-185. ISBN: 978-80-214-4080-7. Detail

KŘOUSTEK, J.; ŽIDEK, S.; KOLÁŘ, D.; MEDUNA, A. 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. p. 165-168. ISBN: 978-1-4244-7357-1. Detail

LUKÁŠ, R.; MEDUNA, A. Multigenerative Grammar Systems and Matrix Grammars. Kybernetika, 2010, vol. 46, no. 1, p. 68-82. ISSN: 0023-5954. Detail

MASOPUST, T.; GOLDEFUS, F.; MEDUNA, A. Left-Forbidding Cooperating Distributed Grammar Systems. Theoretical Computer Science, 2010, vol. 411, no. 40, p. 3661-3667. ISSN: 0304-3975. Detail

MEDUNA, A.; TECHET, J. Scattered Context Grammars and their Applications. WIT Press, UK. WIT Press, UK. WIT Press, UK: WIT Press, 2010. 224 p. ISBN: 978-1-84564-426-0. Detail

MEDUNA, A.; ZEMEK, P. Regulated Grammars and Their Transformations. Brno: Brno University of Technology, 2010. 239 p. ISBN: 978-80-214-4203-0. Detail

PŘIKRYL, Z.; KŘOUSTEK, J.; HRUŠKA, T.; KOLÁŘ, D.; MASAŘÍK, K.; HUSÁR, A. Design and Debugging of Parallel Architectures Using the ISAC Language. Proceedings ot the Annual International Conference on Advanced Distributed and Parallel Computing and Real-Time and Embedded Systems. Singapore: Global Science & Technology Forum, 2010. p. 213-221. ISBN: 978-981-08-7656-2. Detail

ZEMEK, P. k-Limited Erasing Performed by Regular-Controlled Context-Free Grammars. Proceedings of the 16th Conference and Competition STUDENT EEICT 2010. Volume 3. Brno: Faculty of Information Technology BUT, 2010. p. 42-44. ISBN: 978-80-214-4078-4. Detail

2009

ČERMÁK, M. Power Decreasing Derivation Restriction in Grammar Systems. Proceedings of the 15th Conference and Competition STUDENT EEICT 2009 Volume 4. Brno: Faculty of Information Technology BUT, 2009. p. 385-389. ISBN: 978-80-214-3870-5. Detail

CSUHAJ-VARJÚ, E.; MASOPUST, T.; VASZIL, G. Cooperating Distributed Grammar Systems with Permitting Grammars as Components. Romanian Journal of Information Science and Technology (ROMJIST), 2009, vol. 12, no. 2, p. 175-189. ISSN: 1453-8245. Detail

GOLDEFUS, F. Cooperating Distributed Grammar Systems and Graph Controlled Grammar Systems with Infinite Number of Components. Proceedings of the 15th Conference and Competition STUDENT EEICT 2009 Volume 4. 4. Brno: Department of Information Systems FIT BUT, 2009. p. 400-4004. ISBN: 978-80-214-3870-5. Detail

JIRÁK, O. Delayed execution of scattered context grammar rules. Proceedings of the 15th Conference and Competition STUDENT EEICT 2009 Volume 4. Brno: Faculty of Information Technology BUT, 2009. p. 405-409. ISBN: 978-80-214-3870-5. Detail

JIRÁK, O.; KOLÁŘ, D. Derivation in Scattered Context Grammar via Lazy Function Evaluation. 5th Doctoral Workshop on Mathematical and Engineering Methods in Computer Science. Brno: Masaryk University, 2009. p. 118-125. ISBN: 978-80-87342-04-6. Detail

JIRÁK, O.; KOLÁŘ, D. Derivation in Scattered Context Grammar via Lazy Function Evaluation. Annual Doctoral Workshop on Mathematical and Engineering Methods in Computer Science (MEMICS'09). OpenAccess Series in Informatics (OASIcs). Wadern: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, 2009. p. 1-10. ISBN: 978-3-939897-15-6. ISSN: 2190-6807. Detail

KOLÁŘ, D. Exploitation of Scattered Context Grammars to Model Constraints between Components. Proceedings of 31st Autumn International Colloqium ASIS 2009, Advanced Simulation of Systems. Ostrava: 2009. p. 13-18. ISBN: 978-80-86840-47-5. Detail

KOUTNÝ, J. Regular Paths in Derivation Trees of Context-free Grammars. Proceedings of the 15th Conference STUDENT EEICT 2009 Volume 4. Brno: Brno University of Technology, 2009. p. 410-414. ISBN: 978-80-214-3870-5. Detail

KŘIVKA, Z.; MASOPUST, T. A Note on the Cooperation in Rewriting Systems with Context-Dependency Checking. 11th Italian Conference on Theoretical Computer Science. Cremona: 2009. p. 129-135. Detail

KVĚTOŇOVÁ, Š.; KOLÁŘ, D. Optimization of Car Repair Processes by Scattered Context Grammars Application. The 2009 European Simulation and Modelling Conference. Ghent: EUROSIS, 2009. p. 146-149. ISBN: 978-90-77381-52-6. Detail

MASOPUST, T. Regulated Nondeterminism in PDAs: The Non-Regular Case. Proceedings of Workshop on Non-Classical Models of Automata and Applications (NCMA). books@ocg.at Band 256. Wroclaw: Austrian Computer Society, 2009. p. 181-194. ISBN: 978-3-85403-256-4. Detail

MASOPUST, T. A Note on the Generative Power of Some Simple Variants of Context-Free Grammars Regulated by Context Conditions. In LATA 2009 proceedings. Lecture Notes in Computer Science. Lecture notes in computer science. Springer-Verlag Berlin Heidelberg: Springer Verlag, 2009. p. 554-565. ISBN: 978-3-642-00981-5. ISSN: 0302-9743. Detail

MASOPUST, T. On the Descriptional Complexity of Scattered Context Grammars. Theoretical Computer Science, 2009, vol. 410, no. 1, p. 108-112. ISSN: 0304-3975. Detail

MASOPUST, T. On the Terminating Derivation Mode in Cooperating Distributed Grammar Systems with Forbidding Components. International Journal of Foundations of Computer Science, 2009, vol. 20, no. 2, p. 331-340. ISSN: 0129-0541. Detail

MASOPUST, T.; MEDUNA, A. Descriptional Complexity of Three-Nonterminal Scattered Context Grammars: An Improvement. Proceedings of 11th International Workshop on Descriptional Complexity of Formal Systems. Magdeburg: Otto-von-Guericke-University of Magdeburg, 2009. p. 235-245. ISBN: 978-3-940961-31-0. Detail

MASOPUST, T.; MEDUNA, A. On context-free rewriting with a simple restriction and its computational completeness. RAIRO-THEORETICAL INFORMATICS AND APPLICATIONS, 2009, vol. 43, no. 2, p. 365-378. ISSN: 0988-3754. Detail

MASOPUST, T.; MEDUNA, A. On Pure Multi-Pushdown Automata that Perform Complete Pushdown Pops. Acta Cybernetica, 2009, vol. 19, no. 2, p. 537-552. ISSN: 0324-721X. Detail

MEDUNA, A.; TECHET, J. An Infinite Hierarchy of Language Families Generated by Scattered Context Grammars with n-Limited Derivations. Theoretical Computer Science, 2009, vol. 410, no. 21, p. 1961-1969. ISSN: 0304-3975. Detail

RYCHNOVSKÝ, L. Regulated Pushdown Automata Revisited. Proceedings of the 15th Conference STUDENT EEICT 2009. Brno: Faculty of Information Technology BUT, 2009. p. 440-444. ISBN: 978-80-214-3870-5. Detail

2008

ČERMÁK, M. Systémy formálních modelů a jejich aplikace. Proceedings of the 14th Conference Student EEICT 2008. Volume 2. Brno: Fakulta elektrotechniky a komunikačních technologií VUT v Brně, 2008. s. 164-166. ISBN: 978-80-214-3615-2. Detail

JIRÁK, O.; KOLÁŘ, D. Control Flow Graph Retrieval and Analysis via Simulation. MOSIS '08. Ostrava: 2008. p. 67-74. ISBN: 978-80-86840-40-6. Detail

KOLÁŘ, D. Scattered Context Grammars Parsers. Proceedings of the 14th International Congress of Cybernetics and Systems of WOCS. Wroclaw: Wroclaw University of Technology, 2008. p. 491-500. ISBN: 978-83-7493-400-8. Detail

KOLÁŘ, D.; KVĚTOŇOVÁ, Š. Project Plan Formalization and Modeling via Timed CPN. Proceedings of the 6th Industrial Simulation Conference - ISC´08. Ostend: EUROSIS, 2008. p. 34-39. ISBN: 978-90-77381-40-3. Detail

KOLÁŘ, D.; KVĚTOŇOVÁ, Š. Seamless Simplification of Timed-CPN in Project Plan Formalization. 3rd IFIP Central and Eastern European Conference on Software Engineering Techniques CEE-SET 2008. Wroclaw: Wroclaw University of Technology, 2008. p. 29-39. ISBN: 978-83-7493-421-3. Detail

KOLÁŘ, D.; KVĚTOŇOVÁ, Š. Timed Coloured Petri Nets Use in Project Management Formalization Domain. Proceedings of 23th European Simulation and Modelling Conference ESM'2008. France: EUROSIS, 2008. p. 473-478. ISBN: 978-90-77381-44-1. Detail

KOPEČEK, T.; MEDUNA, A. Conditional Grammars and Their Reduction. Brno: Faculty of Information Technology BUT, 2008. 138 p. ISBN: 978-80-214-3750-0. Detail

KOUTNÝ, J. L-systémy a jejich aplikace. Proceedings of the 14th Conference STUDENT EEICT 2008. Volume 2. Brno: Vysoké učení technické v Brně, 2008. s. 170-172. ISBN: 978-80-214-3615-2. Detail

KŘIVKA, Z. Rewriting Systems with Restricted Configurations. Brno: Faculty of Information Technology BUT, 2008. 131 p. ISBN: 978-80-214-3722-7. Detail

MASOPUST, T. Descriptional Complexity of Multi-Parallel Grammars. Information Processing Letters, 2008, vol. 108, no. 2, p. 68-70. ISSN: 0020-0190. Detail

MASOPUST, T.; MEDUNA, A. On Pure Multi-Pushdown Automata that Perform Complete-Pushdown Pops. Automata and Formal Languages. The 12th International Conference, AFL 2008, Balatonfured, Hungary, May 27-30, 2008, Proceedings. Balatonfured: Computer and Automation Research Institute, Hungarian Academy of Sciences, 2008. p. 325-336. ISBN: 978-963-311-367-7. Detail

MASOPUST, T.; MEDUNA, A. On Descriptional Complexity of Partially Parallel Grammars. Fundamenta Informaticae, 2008, vol. 87, no. 3, p. 407-415. ISSN: 0169-2968. Detail

MASOPUST, T.; MEDUNA, A.; ŠIMÁČEK, J. Two Power-Decreasing Derivation Restrictions in Generalized Scattered Context Grammars. Acta Cybernetica, 2008, vol. 18, no. 4, p. 783-793. ISSN: 0324-721X. Detail

MASOPUST, T.; TECHET, J. Leftmost Derivations of Propagating Scattered Context Grammars: A New Proof. DISCRETE MATHEMATICS AND THEORETICAL COMPUTER SCIENCE, 2008, vol. 10, no. 2, p. 39-46. ISSN: 1365-8050. Detail

MEDUNA, A. Elements of Compiler Design. Taylor and Francis. Taylor and Francis. New York: Taylor & Francis Informa plc, 2008. 304 p. ISBN: 978-1-4200-6323-3. Detail

MEDUNA, A.; TECHET, J. Scattered Context Grammars that Erase Nonterminals in a Generalized k-Limited Way. Acta Informatica, 2008, vol. 45, no. 7, p. 593-608. ISSN: 0001-5903. Detail

RYCHNOVSKÝ, L. Start String in Formal Language Theory. Proceedings of the 14th Conference STUDENT EEICT 2008. Brno: Faculty of Information Technology BUT, 2008. p. 422-426. ISBN: 978-80-214-3617-6. Detail

ZEMEK, P. An Infinite Hierarchy of Language Families Resulting from n-limited Programmed Grammars. Proceedings of the 14th Conference STUDENT EEICT 2008. Volume 1. Brno: Faculty of Electrical Engineering and Communication BUT, 2008. p. 164-166. ISBN: 978-80-214-3614-5. Detail

2007

JIRÁK, O. Graf toku řízení. Proceedings of the 13th Conference STUDENT EEICT 2005 Volume 2. Brno: 2007. s. 204-206. ISBN: 978-80-214-3408-0. Detail

KŘIVKA, Z. Deterministic #-Rewriting Systems. Proceedings of the 13th Conference STUDENT EEICT 2007, Volume 4. Brno: Faculty of Electrical Engineering and Communication BUT, 2007. p. 386-390. ISBN: 978-80214-3410-3. Detail

KŘIVKA, Z.; MEDUNA, A. Generalized #-Rewriting Systems of Finite Index. Information Systems and Formal Models (Proceedings of 2nd International Workshop on Formal Models (WFM'07)). Opava: Silesian University, 2007. p. 197-204. ISBN: 978-807248-006-7. Detail

KŘIVKA, Z.; MEDUNA, A.; SMRČEK, J. n-Right-Linear #-Rewriting Systems. Third Doctoral Workshop on Mathematical and Engineering Methods in Computer Science (MEMICS 2007). Znojmo: Ing. Zdeněk Novotný, CSc., 2007. p. 105-112. ISBN: 978-80-7355-077-6. Detail

LORENC, L.; KŘIVKA, Z.; SCHÖNECKER, R. A Note on the Parsing of Complete VHDL-2002. Information Systems and Formal Models (Proceedings of 2nd International Workshop on Formal Models (WFM'07)). Opava: Silesian University, 2007. p. 245-248. ISBN: 978-807248-006-7. Detail

MASOPUST, T. A Note on the Descriptional Complexity of Semi-Conditional Grammars. Information Systems and Formal Models ISIM, WFM '07. Hradec nad Moravici: Silesian University, 2007. p. 213-218. ISBN: 978-80-7248-0067. Detail

MASOPUST, T. Formal models: regulation and reduction. Brno: Faculty of Information Technology BUT, 2007. 103 p. ISBN: 978-80-214-3550-6. Detail

MASOPUST, T. Generalized Forbidding Grammars with Linear Productions. Third Doctoral Workshop on Mathematical and Engineering Methods in Computer Science (MEMICS 2007). Znojmo: Ing. Zdeněk Novotný, CSc., 2007. p. 121-126. ISBN: 978-80-7355-077-6. Detail

MASOPUST, T. Scattered Context Grammars Can Generate the Powers of 2. Proceedings of the 13th Conference STUDENT EEICT 2007, Volume 4. Brno: Faculty of Electrical Engineering and Communication BUT, 2007. p. 401-404. ISBN: 978-80214-3410-3. Detail

MASOPUST, T.; MEDUNA, A. Descriptional Complexity of Generalized Forbidding Grammars. Proceedings of 9th International Workshop on Descriptional Complexity of Formal Systems. High Tatras, Slovakia: University of Pavol Jozef Šafárik, 2007. p. 170-177. ISBN: 978-80-7097-688-3. Detail

MASOPUST, T.; MEDUNA, A. Descriptional complexity of semi-conditional grammars. Information Processing Letters, 2007, vol. 104, no. 1, p. 29-31. ISSN: 0020-0190. Detail

MEDUNA, A.; KOPEČEK, T.; ŠVEC, M. Similar Derivations of Equivalent Grammars. International Journal of Computer Mathematics, 2007, vol. 2007, no. 84, p. 1555-1566. ISSN: 0020-7160. Detail

MEDUNA, A.; LUKÁŠ, R.; FIALA, J. Homogeneous Multicontinuous Grammars and Their Reduction. MEMICS 2007 Proceedings. Znojmo: Ing. Zdeněk Novotný, CSc., 2007. p. 90-96. ISBN: 978-80-7355-077-6. Detail

MEDUNA, A.; MASOPUST, T. Self-Regulating Finite Automata. Acta Cybernetica, 2007, vol. 18, no. 1, p. 135-153. ISSN: 0324-721X. Detail

MEDUNA, A.; TECHET, J. Reduction of Scattered Context Generators of Sentences Preceded by Their Leftmost Parses. Proceedings of 9th International Workshop on Descriptional Complexity of Formal Systems. High Tatras: University of Pavol Jozef Šafárik, 2007. p. 178-185. ISBN: 978-80-7097-688-3. Detail

MEDUNA, A.; TECHET, J. Canonical Scattered Context Generators of Sentences with Their Parses. Theoretical Computer Science, 2007, vol. 2007, no. 389, p. 73-81. ISSN: 0304-3975. Detail

RYCHNOVSKÝ, L. Parsing of Context-Sensitive Languages. Information Systems and Formal Models (Proceedings of 2nd International Workshop on Formal Models (WFM'07)). Opava: Silesian University, 2007. p. 219-226. ISBN: 978-80-7248-006-7. Detail

RYCHNOVSKÝ, L. Type Checking by Context-Sensitive Languages. Proceedings of the 13th Conference STUDENT EEICT 2007, Volume 4. Brno: Faculty of Electrical Engineering and Communication BUT, 2007. p. 405-409. ISBN: 978-80-214-3410-3. Detail

TECHET, J. A Note on Scattered Context Grammars with Non-Context-Free Components. MEMICS 2007 Proceedings. Znojmo: Ing. Zdeněk Novotný, CSc., 2007. p. 225-232. ISBN: 978-80-7355-077-6. Detail

TECHET, J. k-Limited Erasing Performed by Scattered Context Grammars. Information Systems and Formal Models ISIM, WFM '07. Hradec nad Moravicí: Silesian University, 2007. p. 227-234. ISBN: 978-80-7248006-7. Detail

TECHET, J. k-Limited Erasing Performed by Scattered Context Grammars. Proceedings of the 13th Conference STUDENT EEICT 2007, Volume 4. Brno: Faculty of Electrical Engineering and Communication BUT, 2007. p. 419-423. ISBN: 978-80214-3410-3. Detail

2006

KOLÁŘ, D.; BLIŽŇÁK, M. Formal-method-based Software Development Applied on Embedded Systems: Basic concepts. 17th International DAAAM Symposium 2006. Vienna: 2006. p. 45-46. ISBN: 3-901509-57-7. Detail

KOLÁŘ, D.; BLIŽŇÁK, M. Formal-method-based Software Development Applied on Embedded Systems: Platform-independent Source Code. Conference Proceedings of MITIP. Budapest: 2006. p. 487-492. ISBN: 963-86586-5-7. Detail

KŘIVKA, Z.; MEDUNA, A. General Top-Down Parsers Based On Deep Pushdown Expansions. Proceedings of 1st International Workshop on Formal Models (WFM'06). Ostrava: 2006. p. 11-18. ISBN: 80-86840-20-4. Detail

KŘIVKA, Z.; MEDUNA, A.; SCHÖNECKER, R. Generation of Languages by Rewriting Systems that Resemble Automata. International Journal of Foundations of Computer Science, 2006, vol. 17, no. 5, p. 1223-1229. ISSN: 0129-0541. Detail

KŘIVKA, Z.; SCHÖNECKER, R. String-Partitioning Systems and An Infinite Hierarchy. Proceedings of 1st International Workshop on Formal Models (WFM'06). Ostrava: 2006. p. 53-60. ISBN: 80-86840-20-4. Detail

MASOPUST, T. An Improvement of the Descriptional Complexity of Grammars Regulated by Context Conditions. Second Doctoral Workshop on Mathematical and Engineering Methods in Computer Science (MEMICS 2006). Mikulov: Faculty of Information Technology BUT, 2006. p. 105-112. ISBN: 80-214-3287-X. Detail

SCHÖNECKER, R.; KŘIVKA, Z.; MEDUNA, A. Reducing Deep Pushdown Automata and Infinite Hierarchy. MEMICS 2006 Second Doctoral Workshop on Mathematical and Engineering Methods in Computer Science. Mikulov: Faculty of Information Technology BUT, 2006. p. 214-221. ISBN: 80-214-3287-X. Detail

TECHET, J. Bidirectional Contextual Grammars. Proceedings of 1st International Workshop WFM '06. Přerov: 2006. p. 61-68. ISBN: 80-86840-20-4. Detail

2005

BIDLO, R. Context-Free Grammars over Free Groups. Proceedings of 8th International Conference ISIM'05 Information System Implementation and Modeling. Ostrava: 2005. p. 95-100. ISBN: 80-86840-09-3. Detail

BIDLO, R.; BLATNÝ, P. How to Generate Recursively Enumerable Languages Using Only Context-free Productions and Eight Nonterminals. Proceedings of 11th Conference and Competition Student EEICT 2005, Volume 3. Brno: Faculty of Electrical Engineering and Communication BUT, 2005. p. 536-541. ISBN: 80-214-2890-2. Detail

BLATNÝ, P. E0L Grammars on Free Groups. Proceedings of 8th International Conference ISIM'05 Information System Implementation and Modeling. Ostrava: 2005. p. 81-86. ISBN: 80-86840-09-3. Detail

BURGER, T.; HRUŠKA, T. Formalism for the Systems With Roles. papers from the AAAI Fall Symposium. Roles, an Interdisciplinary Perspective: Ontologies, Programming Languages, and Multiagent Systems. Menlo Park, California: American Association for Artificial Intelligence, 2005. p. 26-30. ISBN: 978-1-57735-254-9. Detail

KOLÁŘ, D. Pushdown Automata: Another Extensions and Transformations. Brno: Faculty of Information Technology BUT, 2005. p. 0-0. Detail

KOLÁŘ, D.; MEDUNA, A. Regulated Automata: From Theory towards Applications. Proceeding of 8th International Conference on Information Systems Implementation and Modelling ISIM'05. 1st edition. Ostrava: 2005. p. 33-48. ISBN: 80-86840-09-3. Detail

KOPEČEK, T.; MEDUNA, A.; ŠVEC, M. Simulation of Scattered Context Grammars and Phrase-Structured Grammars by Symbiotic E0L Grammars. In Proceeding of 8th International Conference on Information Systems Implementation and Modelling ISIM'05. Brno: 2005. p. 59-66. ISBN: 80-86840-09-3. Detail

KŘIVKA, Z.; MEDUNA, A. Random Context and Programmed Grammars of Finite Index Have The Same Generative Power. Proceedings of 8th International Conference ISIM'05 Information Systems Implementation and Modelling. 1st edition. Ostrava: 2005. p. 67-72. ISBN: 80-86840-09-3. Detail

LORENC, L. Self-Reproducing Pushdown Translation. Proceedings of the 11th Conference Student EEICT 2005. Volume 3. Brno: Publishing house of Brno University of Technology VUTIUM, 2005. p. 561-565. ISBN: 80-214-2890-2. Detail

LORENC, L.; MEDUNA, A. A Rigorous Approach to Self-Reproducing Pushdown Translation. Proceedings of 8th Spring International Conference ISIM'05 Information Systems Implementation and Modelling. 1st edition. Ostrava: 2005. p. 51-58. ISBN: 80-86840-09-3. Detail

LORENC, L.; MEDUNA, A. Self-Reproducing Pushdown Transducers. Kybernetika, 2005, vol. 2005, no. 4, p. 533-539. ISSN: 0023-5954. Detail

LUKÁŠ, R.; HRUŠKA, T.; KOLÁŘ, D.; MASAŘÍK, K. Two-Way Deterministic Translation and Its Usage in Practice. Proceedings of 8th Spring International Conference - ISIM'05. Ostrava: 2005. p. 101-107. ISBN: 80-86840-09-3. Detail

MEDUNA, A.; LUKÁŠ, R. A Note on Iteratively Extendable Strings. Rostocker mathematisches kolloquium, 2005, vol. 2005, no. 59, p. 71-73. ISSN: 0138-3248. Detail

MEDUNA, A.; ŠVEC, M. Grammars with Context Conditions and Their Applications. Wiley, New York: WILEY, 2005. 225 p. ISBN: 0-471-71831-9. Detail

MEDUNA, A.; TECHET, J. Generation of Sentences with Their Parses: the Case of Propagating Scattered Context Grammars. Acta Cybernetica, 2005, vol. 17, no. 1, p. 11-20. ISSN: 0324-721X. Detail

TECHET, J. Canonical Scattered Context Generators of Sentences with Their Parses. Proceedings of the 11th Conference and Competition STUDENT EEICT 2005 Volume 1. Brno: Faculty of Electrical Engineering and Communication BUT, 2005. p. 280-282. ISBN: 80-214-2888-0. Detail

2004

BLATNÝ, P. Syntaktická analýza založená na gramatikách s rozptýleným kontextem. Proceedings of 10th Conference and Competition Student EEICT 2004, Volume 1. Brno: Fakulta elektrotechniky a komunikačních technologií VUT v Brně, 2004. s. 191-193. ISBN: 80-214-2634-9. Detail

BLATNÝ, P. Syntaktická analýza založená na gramatikách s rozptýleným kontextem. SVOČ 2004 - Soutěž vysokoškoláků ve vědecké odborné činnosti v matematice. Brno: Fakulta strojního inženýrství VUT, 2004. s. 32-32. ISBN: 0. Detail

TECHET, J. Generation of Sentences with Their Parses by Scattered Context Grammars. Proceedings of the 10th Conference and Competition STUDENT EEICT 2004 Volume 1. Brno: Faculty of Electrical Engineering and Communication BUT, 2004. p. 227-229. ISBN: 80-214-2634-9. Detail

TECHET, J. Generation of Sentences with Their Parses by Scattered Context Grammars. Proceedings of the International Conference and Competition of Students' Scientific Works STUDENT EEICT 2004. Bratislava: Slovak University of Technology in Bratislava, 2004. p. 113-119. ISBN: 80-227-2057-7. Detail

2003

BLATNÝ, P. Syntaktická analýza založená na 2-limitových gramatikách s rozptýleným kontextem. Proceedings of 9th Conference and Competition Student EEICT 2003, Volume 1. Brno: Fakulta elektrotechniky a komunikačních technologií VUT v Brně, 2003. s. 167-169. ISBN: 80-214-2377-3. Detail