Publications

• 2024

  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 | WWW

• 2022

  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 | WWW

  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 | WWW

  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 | WWW

  KOLÁŘ, D.; MEDUNA, A.; TOMKO, M. Multi-Island Finite Automata and Their Even Computations. Kybernetika, 2022, vol. 57, no. 5, p. 856-877. ISSN: 0023-5954.
  Detail | WWW

  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 | WWW

• 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 | WWW

  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 | WWW

• 2020

  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 | WWW

  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 | WWW

• 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 | WWW

  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 | WWW

• 2018

  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 | WWW

  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 | WWW

  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 | WWW

  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 | WWW

  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 | WWW

• 2017

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

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

  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 | WWW

  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 | WWW

  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 | WWW

  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 | WWW

• 2016

  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 | WWW

  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 | WWW

  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 | WWW

  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 | WWW

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

• 2015

  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 | WWW

  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 | WWW

  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 | WWW

• 2014

  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 | WWW

  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 | WWW

  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 | WWW

  TESAŘ, R.; KŘIVKA, Z.; MEDUNA, A. Alan Mathison Turing - život a dílo. Pokroky matematiky, fyziky a astronomie, 2014, vol. 59, no. 2, p. 89-104. ISSN: 0032-2423.
  Detail | WWW

  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 | WWW

  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 | WWW

  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.; 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 | WWW

  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 | WWW

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

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

• 2013

  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 | WWW

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

  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 | WWW

• 2012

  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 | WWW

  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 | WWW

  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 | WWW

  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 | WWW

  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 | WWW

  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 | WWW

  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 | WWW

  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 | WWW

  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 | WWW

• 2011

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

  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. Workspace Theorems for Regular-Controlled Grammars. Theoretical Computer Science, 2011, vol. 412, no. 35, p. 4604-4612. ISSN: 0304-3975.
  Detail | WWW

  Č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 | WWW

  Č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. 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 | WWW

  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 | WWW

  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

  ĎURFINA, L.; KŘOUSTEK, J.; ZEMEK, P.; KOLÁŘ, D.; HRUŠKA, T.; MASAŘÍK, K.; MEDUNA, A. Design of an Automatically Generated Retargetable Decompiler. 2nd European Conference of COMPUTER SCIENCE (ECCS'11). Puerto De La Cruz, Tenerife: North Atlantic University Union, 2011. p. 199-204. ISBN: 978-1-61804-056-5.
  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

  ĎURFINA, L.; KŘOUSTEK, J.; ZEMEK, P.; KOLÁŘ, D.; HRUŠKA, T.; MASAŘÍK, K.; MEDUNA, A. Advanced Static Analysis for Decompilation Using Scattered Context Grammars. Proceedings of the Applied Computing Conference 2011 (ACC'11). Angers: World Scientific and Engineering Academy, 2011. p. 164-169. ISBN: 978-1-61804-051-0.
  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 | WWW

  Ď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. International Journal of Security and Its Applications, 2011, vol. 5, no. 4, p. 91-106. ISSN: 1738-9976.
  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

  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

• 2010

  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

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

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

  MEDUNA, A. Finitely Expandable Deep PDAs. In Automata, Formal Languages and Algebraic Systems. Hong Kong: Hong Kong University of Scinece and Technology, 2010. p. 113-123. ISBN: 981-4317-60-8.
  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

  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 | WWW

• 2009

  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 | WWW

  MEDUNA, A.; GOLDEFUS, F. Weak Leftmost Derivations in Cooperative Distributed Grammar Systems. MEMICS 09. Brno: Brno University of Technology, 2009. p. 144-151. ISBN: 978-80-87342-04-6.
  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 | WWW

  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

• 2008

  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

  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 | WWW

  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 | WWW

  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

  MEDUNA, A.; RYCHNOVSKÝ, L. Infinite Language Hierarchy Based on Regular-Regulated Right-Linear Grammars with Start Strings. Philippine Computing Journal, 2008, vol. 2008, no. 3, p. 1-5. ISSN: 1908-1995.
  Detail | WWW

  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. New Trends in Algebraic Theory of Automata. ICDMA. Bangkok: University of South Australia, 2008. p. 211-222. ISBN: 0-7167-8261-8.
  Detail

  MEDUNA, A. Conditional grammars are discussed. New Delhi: 2008. p. 214-226.
  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 | WWW

• 2007

  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 | WWW

  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 | WWW

  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

  LUKÁŠ, R.; MEDUNA, A. General Multigenerative Grammar Systems. Information Systems and Formal Models ISIM, WFM '07. Hradec nad Moravicí: Silesian University, 2007. p. 205-212. ISBN: 978-80-7248006-7.
  Detail

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

  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

  MASOPUST, T.; MEDUNA, A. Descriptional Complexity of Grammars Regulated by Context Conditions. LATA 2007 Pre-proceedings. Reports of the Research Group on Mathematical Linguistics 35/07, Universitat Rovira i Virgili. Tarragona, Spain: 2007. p. 403-411.
  Detail

  BIDLO, R.; BLATNÝ, P.; MEDUNA, A. Automata with Two-Sided Pushdowns Defined over Free Groups Generated by Reduced Alphabets. Kybernetika, 2007, vol. 2007, no. 1, p. 21-35. ISSN: 0023-5954.
  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

  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. Maximal and Minimal Scattered Context Rewriting. FCT 2007 Proceedings. Lecture Notes in Computer Science. Budapest: Springer Verlag, 2007. p. 412-423. ISSN: 0302-9743.
  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 | WWW

  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

  BIDLO, R.; BLATNÝ, P.; MEDUNA, A. Context-Free and E0L Derivations over Free Groups. Schedae Informaticae, 2007, vol. 2007, no. 16, p. 14-24. ISSN: 0860-0295.
  Detail

• 2006

  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

  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 | WWW

  MEDUNA, A. Deep Pushdown Automata. Acta Informatica, 2006, vol. 2006, no. 98, p. 114-124. ISSN: 0001-5903.
  Detail

  LUKÁŠ, R.; MEDUNA, A. Multigenerative Grammar Systems. Proceedings of 1st International Workshop - WFM. Přerov: 2006. p. 19-26. ISBN: 80-86840-20-4.
  Detail

  MEDUNA, A.; LUKÁŠ, R. Multigenerative Grammar Systems. Schedae Informaticae, 2006, vol. 2006, no. 15, p. 175-188. ISSN: 0860-0295.
  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

  MEDUNA, A.; BIDLO, R.; BLATNÝ, P. Vertical Context in Phrase-Structure grammars. Second Doctoral Workshop on Mathematical and Engineering Methods in Computer Science (MEMICS 2006). Mikulov: Brno University of Technology, 2006. p. 17-23. ISBN: 80-214-3287-X.
  Detail

• 2005

  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

  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.; 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

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

  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

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

  BIDLO, R.; BLATNÝ, P.; MEDUNA, A. Formal Models over Free Groups. PRE-PROCEEDINGS of the 1st Doctoral Workshop on Mathematical and Engineering Methods in Computer Science. Brno: Faculty of Informatics MU, 2005. p. 193-199. ISBN: 0.
  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

  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

  LORENC, L.; MEDUNA, A. Self-Reproducing Translation Made by Pushdown Transducers. PRE-PROCEEDINGS of the 1st Doctoral Workshop on Mathematical and Engineering Methods in Computer Science. Brno: Faculty of Informatics MU, 2005. p. 59-67.
  Detail

• 2004

  MEDUNA, A.; ŠKRKAL, O. Combined Leftmost Derivations in Matrix Grammars. Proceedings of 7th International Conference ISIM'04 Information Systems Implementation and Modelling. 1st edition. Ostrava: 2004. p. 127-132. ISBN: 80-85988-99-2.
  Detail

  MEDUNA, A.; VÍTEK, M. New language operations in formal language theory. Schedae Informaticae, 2004, vol. 2004, no. 13, p. 123-150. ISSN: 0860-0295.
  Detail

  MEDUNA, A. Two-Way Metalinear PC Grammar Systems and Their Descriptional Complexity. Acta Cybernetica, 2004, vol. 2004, no. 16, p. 385-397. ISSN: 0324-721X.
  Detail

  ELBL, S.; MEDUNA, A. Grammar Systems of Finite Index. Proceedings of 7th International Conference ISIM '04. Ostrava: 2004. p. 141-146. ISBN: 80-85988-99-2.
  Detail

  LORENC, L.; MEDUNA, A. Self-Reproducing Pushdown Transducers. Proceedings of 7th International Conference ISIM'04 Information Systems Implementation and Modelling. 1st edition. Ostrava: 2004. p. 155-160. ISBN: 80-85988-99-2.
  Detail

  KOPEČEK, T.; MEDUNA, A. Simple-Semi-Conditional Versions of Matrix Grammars with a Reduced Regulating Mechanism. Computing and Informatics, 2004, vol. 2004, no. 23, p. 287-302. ISSN: 1335-9150.
  Detail

  ELBL, S.; MEDUNA, A. Finite Index in Language Theory. Proceedings of 10th Conference and Competition STUDENT EEICT 2004. Brno: Faculty of Information Technology BUT, 2004. p. 247-251. ISBN: 80-214-2635-7.
  Detail

• 2003

  MEDUNA, A.; ŠVEC, M. Forbidding E0L Systems. Theoretical Computer Science, 2003, vol. 2003, no. 306, p. 449-469. ISSN: 0304-3975.
  Detail

  MEDUNA, A. Simultaneously One-Turn Two-Pushdown Automata. International Journal of Computer Mathematics, 2003, vol. 2003, no. 80, p. 679-687. ISSN: 0020-7160.
  Detail

  MEDUNA, A.; HRUŠKA, T. Ulice ponese jméno geniálního matematika a brněnského rodáka (o Gödelovi). Události na VUT v Brně, 2003, vol. 2003, no. 10, p. 24-24. ISSN: 1211-4421.
  Detail

  MEDUNA, A. On the Degree of Scattered Context-Sensitivity. Theoretical Computer Science, 2003, vol. 2003, no. 290, p. 2121-2124. ISSN: 0304-3975.
  Detail

  MEDUNA, A. A Simultaneous Reduction of Several Measures of Descriptional Complexity in Scattered Context Grammars. Information Processing Letters, 2003, vol. 2003, no. 86, p. 235-240. ISSN: 0020-0190.
  Detail

  MEDUNA, A. Coincidental Extention of Scattered Context Languages. Acta Informatica, 2003, vol. 2003, no. 112, p. 307-314. ISSN: 0001-5903.
  Detail

  MEDUNA, A.; ŠVEC, M. Descriptional Complexity of Generalized Forbidding Grammars. International Journal of Computer Mathematics, 2003, vol. 2003, no. 80, p. 11-17. ISSN: 0020-7160.
  Detail

• 2002

  MEDUNA, A. Descriptional Complexity of Scattered Rewriting and Multirewriting: An Overview. Journal of Automata, Languages and Combinatorics, 2002, vol. 2002, no. 7, p. 571-577. ISSN: 1430-189X.
  Detail

  HRUBÝ, M.; MEDUNA, A.; VURM, P. Model syntaktické analýzy formálních jazyků. Proceedings of XXIVth International Autumn Colloquium ASIS 2002. Ostrava: MARQ, 2002. p. 109-114. ISBN: 80-85988-77-1.
  Detail | WWW

  KOLÁŘ, D.; MEDUNA, A. Homogenous Grammars with a Reduced Number of Non-Context-Free Productions. Information Processing Letters, 2002, vol. 2002, no. 81, p. 253-257. ISSN: 0020-0190.
  Detail

  CHVALINA, J., MEDUNA, A., NOVÁK, V. Profesor Miroslav Novotný osmdesátiletý. Pokroky matematiky, fyziky a astronomie, 2002, vol. 2002, no. 2, p. 168 ( p.)ISSN: 0032- 2423.
  Detail

  MEDUNA, A.; ŠVEC, M. Reduction of Simple Semi-Conditional Grammars with Respect to the Number of Conditional Productions. Acta Cybernetica, 2002, vol. 2002, no. 15, p. 353-360. ISSN: 0324-721X.
  Detail

• 2001

  MEDUNA, A. Descriptional Complexity of Partially Parallel Grammars. DCAGRS. Vienna: 2001. p. 15-21. ISBN: 0-7167-8261-8.
  Detail

  MEDUNA, A. Uniform Generation of Languages by Scattered Context Grammars. Fundamenta Informaticae, 2001, vol. 2001, no. 45, p. 231-235. ISSN: 0169-2968.
  Detail

  MEDUNA, A.; VURM, P. Multisequential Grammars with Homogeneous Selectors. International Journal of Computer Mathematics, 2001, vol. 2001, no. 34, p. 1-7. ISSN: 0020-7160.
  Detail

  MEDUNA, A.; KOLÁŘ, D. One-Turn Regulated Pushdown Automata and Their Reduction. Fundamenta Informaticae, 2001, vol. 2001, no. 21, p. 1001-1007. ISSN: 0169-2968.
  Detail

• 2000

  KOLÁŘ, D.; MEDUNA, A. Descriptional complexity of multi-parallel grammars with respect to the number of nonterminals. In Grammars and Automata for String Processing: from Mathematics and Computer Science to Biology, and Back. London: unknown, 2000. p. 212-225. ISBN: 1-85233-074-0.
  Detail

  MEDUNA, A. Terminating Left-Hand Sides of Scattered Context Grammars. Theoretical Computer Science, 2000, vol. 2000, no. 237, p. 424-427. ISSN: 0304-3975.
  Detail

  MEDUNA, A. Context-Free Multirewriting with a Reduced Number of Nonterminals. Brno: Brno University of Technology, 2000. p. 0-0.
  Detail

  KOLÁŘ, D.; MEDUNA, A. Regulated Pushdown Automata. Acta Cybernetica, 2000, vol. 2000, no. 4, p. 653-664. ISSN: 0324-721X.
  Detail

  MEDUNA, A. Generative Power of Three-Nonterminal Scattered Context Grammars. Theoretical Computer Science, 2000, vol. 2000, no. 246, p. 279-284. ISSN: 0304-3975.
  Detail

• 1999

  MEDUNA, A. Prefix Pushdown Automata. International Journal of Computer Mathematics, 1999, vol. 1999, no. 71, p. 1-20. ISSN: 0020-7160.
  Detail

• 1998

  MEDUNA, A. Uniform Rewriting Based on Permutations. International Journal of Computer Mathematics, 1998, p. 57-74. ISSN: 0020-7160.
  Detail

  MEDUNA, A. Economical Transformations of Scattered Context Grammars to Phrase-Structure Grammars. Acta Cybernetica, 1998, vol. 1998, no. 13, p. 225-242. ISSN: 0324-721X.
  Detail

  MEDUNA, A. Descriptional Complexity of Multi-Continues Grammars. Acta Cybernetica, 1998, vol. 1998, no. 13, p. 375-384. ISSN: 0324-721X.
  Detail

  MEDUNA, A. Middle Quotients of Linear Languages. International Journal of Computer Mathematics, 1998, p. 281-289. ISSN: 0020-7160.
  Detail

• 1997

  MEDUNA, A. On the Number of Nonterminals in Matrix Grammars with Leftmost Derivations. In New Trends in Formal Languages: Control, Cooperation, and Combinatorics. New York: Springer Verlag, 1997. p. 27-39.
  Detail

  MEDUNA, A. Four-Nonterminal Scattered Context Grammars Characterize the Family of Recursively Enumerable Languages. International Journal of Computer Mathematics, 1997, vol. 1997, no. 63, p. 67-83. ISSN: 0020-7160.
  Detail

  MEDUNA, A. Six-Nonterminal Multi-Sequential Grammars Characterize the Family of Recursively Enumerable Languages. International Journal of Computer Mathematics, 1997, vol. 1997, no. 65, p. 179-189. ISSN: 0020-7160.
  Detail

• 1996

  MEDUNA, A. Syntactic Complexity of Context-Free Grammars over Word Monoids. Acta Informatica, 1996, vol. 1996, no. 33, p. 457-462. ISSN: 0001-5903.
  Detail

• 1995

  MEDUNA, A. Syntactic Complexity of Scattered Context Grammars. Acta Informatica, 1995, vol. 1995, no. 32, p. 285-298. ISSN: 0001-5903.
  Detail

  MEDUNA, A. Symbiotic E0L Systems. In Artifical Life:Grammatical Models. Bucharest: unknown, 1995. p. 122-129.
  Detail

  MEDUNA, A. A Trivial Method of Characterizing the Family of Recursively Enumerable Languages by Scattered Context Grammars. Bulletin of the European Association for Theoretical Computer Science, 1995, vol. 1995, no. 56, p. 1-3. ISSN: 0252-9742.
  Detail

• 1994

  MEDUNA, A. Matrix Grammars under Leftmost and Rightmost Restrictions. In Mathematical Linguistics and Related Topics. Bucharest: unknown, 1994. p. 243-257.
  Detail

  GOPALARATNAM, A.; MEDUNA, A. On Semi-Conditional Grammars with Productions Having either Forbidding or Permitting Conditions. Kybernetika, 1994, vol. 1994, no. 11, p. 307-324. ISSN: 0023-5954.
  Detail

• 1993

  MEDUNA, A. Parallel Formal Models in the Formal Language Theory. Missourian Annual Conference on Computing. Columbia: 1993. p. 78-82.
  Detail

  MEDUNA, A. Canonical Scattered Rewriting. International Journal of Computer Mathematics, 1993, p. 122-129. ISSN: 0020-7160.
  Detail

  MEDUNA, A. A Formalization of Sequential, Parallel, and Continuous Rewriting. International Journal of Computer Mathematics, 1993, vol. 1993, no. 47, p. 153-161. ISSN: 0020-7160.
  Detail

  CROOKS, C.; MEDUNA, A.; ŠÁREK, M. Syntactic Complexity of Regulated Rewriting. Kybernetika, 1993, vol. 1993, no. 30, p. 177-186. ISSN: 0023-5954.
  Detail

  CSUHAJ-VARJÚ, E.; MEDUNA, A. Grammars with Context Conditions. Kybernetika, 1993, p. 199-213. ISSN: 0023-5954.
  Detail

• 1992

  MEDUNA, A. L Systems and Their Applications. Missourian Annual Conference on Computing. Columbia: 1992. p. 56-62.
  Detail

  MEDUNA, A. Symbiotic E0L Systems. Acta Cybernetica, 1992, vol. 1992, no. 10, p. 165-172. ISSN: 0324-721X.
  Detail

• 1991

  MEDUNA, A. Scattered Rewriting in the Formal Language Theory. Missourian Annual Conference on Computing. Columbia: 1991. p. 26-36.
  Detail

  MEDUNA, A. Controlled Systolic Automata. Parallel Computation in the Midwestern Academic Environment. Rolla: 1991. p. 56-66.
  Detail

  MEDUNA, A. Global Context Conditional Grammars. Journal of Automata, Languages and Combinatorics, 1991, vol. 1991, no. 27, p. 159-165. ISSN: 1430-189X.
  Detail

• 1990

  MEDUNA, A. Context-Free Derivations on Word Monoids. Acta Informatica, 1990, vol. 1990, no. 27, p. 781-786. ISSN: 0001-5903.
  Detail

  MEDUNA, A. Parallel Compilers Based on L Systems. Parallel Computation in the Midwestern Academic Environment. Rolla: 1990. p. 215-224.
  Detail

  MEDUNA, A. Regulated Rewriting. Missourian Annual Conference on Computing. Columbia: 1990. p. 25-31.
  Detail

  MEDUNA, A. Generalized Forbidding Grammars. International Journal of Computer Mathematics, 1990, p. 31-38. ISSN: 0020-7160.
  Detail

• 1988

  HORVAT, G.; MEDUNA, A. On State Grammars. Acta Cybernetica, 1988, vol. 1988, no. 8, p. 237-245. ISSN: 0324-721X.
  Detail

• 1987

  MEDUNA, A. Grammars, Automata, and Compilers. Brno: unknown, 1987. p. 0-0.
  Detail

  MEDUNA, A. Characterization of the Chomsky Hierarchy through Sequential-Parallel Grammars. Rostocker mathematisches kolloquium, 1987, vol. 1987, no. 32, p. 4-14. ISSN: 0138-3248.
  Detail

  MEDUNA, A. Evaluated Grammars. Acta Cybernetica, 1987, vol. 1987, no. 8, p. 169-176. ISSN: 0324-721X.
  Detail

• 1986

  MEDUNA, A. A Note on Exponential Density of ET0L Languages. Kybernetika, 1986, vol. 1986, no. 22, p. 514-518. ISSN: 0023-5954.
  Detail

  MEDUNA, A.; ZATLOUKAL, A. A General System for Sorting and Print. 1986, p. 30-38.
  Detail

  MEDUNA, A.; VIČAROVÁ, Z. Operating Systems II. Olomouc: unknown, 1986. p. 0-0.
  Detail

• 1984

  MEDUNA, A.; VIČAROVÁ, Z. Operating Systems I. Olomouc: unknown, 1984. p. 0-0.
  Detail

*) Publications are generated once a 24 hours.