Prof. RNDr.

Alexander Meduna

CSc.

Deputy Head of Department

+420 54114 1232
meduna@fit.vut.cz
Office C216

[photo]

Publications

  • 2020

    KŘIVKA Zbyněk, MARTIŠKO Jakub and MEDUNA Alexander. CD Grammar Systems with Two Propagating Scattered Context Components Characterize the Family of Context Sensitive Languages. International Journal of Foundations of Computer Science, pp. 1-15. ISSN 0129-0541.
    Detail

    KOCMAN Radim, KŘIVKA Zbyněk and MEDUNA Alexander. General CD Grammar Systems and Their Simplification. Journal of Automata, Languages and Combinatorics, vol. 25, no. 1, pp. 37-54. ISSN 1430-189X.
    Detail

    HORÁČEK Petr, MEDUNA Alexander and TOMKO Martin. Handbook of Mathematical Models for Languages and Computation. Stevenage, United Kingdom: The Institution of Engineering and Technology, 2020. ISBN 978-1-78561-659-4.
    Detail

  • 2019

    KŘIVKA Zbyněk, KUČERA Jiří and MEDUNA Alexander. Jumping Pure Grammars. The Computer Journal, vol. 62, no. 1, pp. 30-41. ISSN 0010-4620.
    Detail

    MEDUNA Alexander, KRČMÁŘ Radim, KÖVÁRI Adam and BENÍČKOVÁ Zuzana. On Operations over Language Families. Computer Science Journal of Moldova, vol. 27, no. 3, pp. 255-282. ISSN 1561-4042.
    Detail

  • 2018

    KOCMAN Radim, NAGY Benedek, KŘIVKA Zbyněk and MEDUNA Alexander. A Jumping 5'->3' Watson-Crick Finite Automata Model. In: Tenth Workshop on Non-Classical Models of Automata and Applications (NCMA 2018). books@ocg.at 332. Wien: Austrian Computer Society, 2018, pp. 117-132. ISBN 978-3-903035-21-8.
    Detail

    CHARVÁT Lucie and MEDUNA Alexander. A Reduction of Finitely Expandable Deep Pushdown Automata. Schedae Informaticae, vol. 2017, no. 26, pp. 61-68. ISSN 0860-0295.
    Detail

    CHARVÁT Lucie and MEDUNA Alexander. Internally Expandable Pushdown Automata and Their Computational Completeness. Romanian Journal of Information Science and Technology (ROMJIST), vol. 21, no. 3, pp. 232-237. ISSN 1453-8245.
    Detail

    KOCMAN Radim, KŘIVKA Zbyněk and MEDUNA Alexander. On Double-Jumping Finite Automata and Their Closure Properties. RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, vol. 52, no. 2, pp. 185-199. ISSN 0988-3754.
    Detail

    KŘIVKA Zbyněk, KUČERA Jiří and MEDUNA Alexander. On k#$-Rewriting Systems. Romanian Journal of Information Science and Technology (ROMJIST), vol. 21, no. 3, pp. 278-287. ISSN 1453-8245.
    Detail

  • 2017

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

    MEDUNA Alexander and MARTIŠKO Jakub. 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. Debrecen: Open Publishing Association, 2017, pp. 170-179. ISSN 2075-2180.
    Detail

    MEDUNA Alexander and SOUKUP Ondřej. Jumping Scattered Context Grammars. Fundamenta Informaticae, vol. 152, no. 1, pp. 51-86. ISSN 0169-2968.
    Detail

    MEDUNA Alexander and SOUKUP Ondřej. Modern Language Models and Computation: Theory with Applications. New York: Springer US, 2017. ISBN 978-3-319-63099-1.
    Detail

    CSUHAJ-VARJÚ Erzsébet, MEDUNA Alexander and SOUKUP Ondřej. On Tree-Restricted Regular-Controlled Context-Free Grammars. International Journal of Computer Mathematics: Computer Systems Theory, vol. 2, no. 4, pp. 147-163. ISSN 2379-9927.
    Detail

    KOCMAN Radim, KŘIVKA Zbyněk and MEDUNA Alexander. Rule-Homogeneous CD Grammar Systems. AFL 2017. Debrecen, 2017.
    Detail

  • 2016

    KOCMAN Radim, KŘIVKA Zbyněk and MEDUNA Alexander. On Double-Jumping Finite Automata. In: Eighth Workshop on Non-Classical Models of Automata and Applications (NCMA 2016). books@ocg.at 321. Wien: Austrian Computer Society, 2016, pp. 195-210. ISBN 978-3-903035-10-2.
    Detail

    KOCMAN Radim and MEDUNA Alexander. 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, vol. 511. Cham: Springer International Publishing, 2016, pp. 142-149. ISBN 978-3-319-46534-0.
    Detail

    KUČERA Jiří and MEDUNA Alexander. On State-Synchronized Automata Systems. Schedae Informaticae, vol. 2015, no. 24, pp. 221-237. ISSN 0860-0295.
    Detail

    KŘIVKA Zbyněk, MEDUNA Alexander and ZEMEK Petr. Phrase-Structure Grammars: Normal Forms and Reduction. The Computer Journal, vol. 59, no. 8, pp. 1180-1185. ISSN 0010-4620.
    Detail

    MEDUNA Alexander and SOUKUP Ondřej. Simple Matrix Grammars and Their Leftmost Variants. International Journal of Foundations of Computer Science, vol. 27, no. 3, pp. 359-373. ISSN 0129-0541.
    Detail

  • 2015

    KUČERA Jiří, MEDUNA Alexander and SOUKUP Ondřej. Absolutely Unlimited Deep Pushdown Automata. In: Proceedings of the 10th Doctoral Workshop on Mathematical and Engineering Methods in Computer Science (MEMICS 2015). Telč: Ing. Vladislav Pokorný - Litera, 2015, pp. 36-44. ISBN 978-80-214-5254-1.
    Detail

    KŘIVKA Zbyněk and MEDUNA Alexander. Jumping Grammars. International Journal of Foundations of Computer Science, vol. 26, no. 6, pp. 709-731. ISSN 0129-0541.
    Detail

    MEDUNA Alexander, SOUKUP Ondřej and ZEMEK Petr. Ordered Pure Multi-Pushdown Automata. Theoretical and Applied Informatics, vol. 27, no. 1, pp. 25-47. ISSN 1896-5334.
    Detail

  • 2014

    KŘIVKA Zbyněk, MARTÍN-VIDE Carlos, MEDUNA Alexander and SUBRAMANIAN K.G. 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, ISSN 0302-9743, Vol. 8466, vol. 2014. Brno: Springer Verlag, 2014, pp. 123-133. ISBN 978-3-319-07147-3. ISSN 0302-9743.
    Detail

    TESAŘ Radek, KŘIVKA Zbyněk and MEDUNA Alexander. Alan Mathison Turing - život a dílo. Pokroky matematiky, fyziky a astronomie, vol. 58, no. 2, pp. 1-19. ISSN 0032-2423.
    Detail

    MEDUNA Alexander and SOUKUP Ondřej. Computational Completeness Resulting from Scattered Context Grammars Working Under Various Derivation Modes. In: Proceedings of MEMICS'14. Brno: NOVPRESS s.r.o., 2014, pp. 89-100. ISBN 978-80-214-5022-6.
    Detail

    MEDUNA Alexander and ZEMEK Petr. Controlled Finite Automata. Acta Informatica, vol. 51, no. 5, pp. 327-337. ISSN 0001-5903.
    Detail

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

    HORÁČEK Petr and MEDUNA Alexander. New Grammar Systems and Their Application Perspectives. Schedae Informaticae, vol. 2013, no. 22, pp. 47-68. ISSN 0860-0295.
    Detail

    KOUTNÝ Jiří and MEDUNA Alexander. On Normal Forms and Erasing Rules in Path-Controlled Grammars. Schedae Informaticae, vol. 2013, no. 22, pp. 9-18. ISSN 0860-0295.
    Detail

    MEDUNA Alexander and ZEMEK Petr. One-Sided Random Context Grammars with a Limited Number of Right Random Context Rules. Theoretical Computer Science, vol. 516, no. 1, pp. 127-132. ISSN 0304-3975.
    Detail

    MEDUNA Alexander and ZEMEK Petr. One-Sided Random Context Grammars: A Survey. Computing with New Resources. Berlin: Springer Verlag, 2014, pp. 338-351. ISBN 978-3-319-13349-2.
    Detail

    MEDUNA Alexander and ZEMEK Petr. Regulated Grammars and Automata. New York: Springer US, 2014. ISBN 978-1-4939-0368-9.
    Detail

    MEDUNA Alexander, VRÁBEL Lukáš and ZEMEK Petr. Solutions To Four Open Problems Concerning Controlled Pure Grammar Systems. International Journal of Computer Mathematics, vol. 91, no. 6, pp. 1156-1169. ISSN 0020-7160.
    Detail

  • 2013

    MEDUNA Alexander and ZEMEK Petr. Generalized One-Sided Forbidding Grammars. International Journal of Computer Mathematics, vol. 90, no. 2, pp. 172-182. ISSN 0020-7160.
    Detail

    MEDUNA Alexander and ZEMEK Petr. Left Random Context ET0L Grammars. Fundamenta Informaticae, vol. 123, no. 3, pp. 289-304. ISSN 0169-2968.
    Detail

    MEDUNA Alexander and ZEMEK Petr. On the Generation of Sentences with Their Parses by Propagating Regular-Controlled Grammars. Theoretical Computer Science, vol. 477, no. 1, pp. 67-75. ISSN 0304-3975.
    Detail

  • 2012

    MEDUNA Alexander, VRÁBEL Lukáš and ZEMEK Petr. An Infinite Hierarchy of Language Families Resulting from Stateless Pushdown Automata with Limited Pushdown Alphabets. In: DCFS'12: 14th International Workshop on Descriptional Complexity of Formal Systems. Lecture Notes in Computer Science, vol. 7386. Braga: Springer Verlag, 2012, pp. 236-243. ISBN 978-3-642-31622-7. ISSN 0302-9743.
    Detail

    MEDUNA Alexander and ZEMEK Petr. Controlled Pure Grammar Systems. Journal of Universal Computer Science, vol. 18, no. 14, pp. 2024-2040. ISSN 0948-6968.
    Detail

    MEDUNA Alexander and ZEMEK Petr. Jumping Finite Automata. International Journal of Foundations of Computer Science, vol. 23, no. 7, pp. 1555-1578. ISSN 0129-0541.
    Detail

    MEDUNA Alexander and ZEMEK Petr. Nonterminal Complexity of One-Sided Random Context Grammars. Acta Informatica, vol. 49, no. 2, pp. 55-68. ISSN 0001-5903.
    Detail

    MEDUNA Alexander and ZEMEK Petr. One-Sided Forbidding Grammars and Selective Substitution Grammars. International Journal of Computer Mathematics, vol. 89, no. 5, pp. 586-596. ISSN 0020-7160.
    Detail

    MEDUNA Alexander and 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, pp. 160-173. ISBN 978-3-642-31643-2.
    Detail

    ČERMÁK Martin, KOUTNÝ Jiří and MEDUNA Alexander. Parsing Based on n-Path Tree-Controlled Grammars. Theoretical and Applied Informatics, vol. 2011, no. 23, pp. 213-228. ISSN 1896-5334.
    Detail

    ČERMÁK Martin, HORÁČEK Petr and MEDUNA Alexander. Rule-restricted automaton-grammar transducers: Power and linguistic applications. Mathematics for Applications, vol. 1, no. 1, pp. 13-35. ISSN 1805-3610.
    Detail

    ČERMÁK Martin, HORÁČEK Petr and 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.
    Detail

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

    KOUTNÝ Jiří and MEDUNA Alexander. Tree-controlled Grammars with Restrictions Placed upon Cuts and Paths. Kybernetika, vol. 48, no. 1, pp. 165-175. ISSN 0023-5954.
    Detail

  • 2011

    ĎURFINA Lukáš, KŘOUSTEK Jakub, ZEMEK Petr, KOLÁŘ Dušan, HRUŠKA Tomáš, MASAŘÍK Karel and MEDUNA Alexander. Advanced Static Analysis for Decompilation Using Scattered Context Grammars. In: Proceedings of the Applied Computing Conference 2011 (ACC'11). Angers: World Scientific and Engineering Academy, 2011, pp. 164-169. ISBN 978-1-61804-051-0.
    Detail

    ĎURFINA Lukáš, KŘOUSTEK Jakub, ZEMEK Petr, KOLÁŘ Dušan, HRUŠKA Tomáš, MASAŘÍK Karel and MEDUNA Alexander. Design of a Retargetable Decompiler for a Static Platform-Independent Malware Analysis. In: The 5th International Conference on Information Security and Assurance. Communications in Computer and Information Science, Volume 200. Brno: Springer Verlag, 2011, pp. 72-86. ISBN 978-3-642-23140-7.
    Detail

    ĎURFINA Lukáš, KŘOUSTEK Jakub, ZEMEK Petr, KOLÁŘ Dušan, HRUŠKA Tomáš, MASAŘÍK Karel and 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: Masaryk University, 2011, pp. 114-114. ISBN 978-80-214-4305-1.
    Detail

    ĎURFINA Lukáš, KŘOUSTEK Jakub, ZEMEK Petr, KOLÁŘ Dušan, HRUŠKA Tomáš, MASAŘÍK Karel and MEDUNA Alexander. Design of a Retargetable Decompiler for a Static Platform-Independent Malware Analysis. International Journal of Security and Its Applications, vol. 5, no. 4, pp. 91-106. ISSN 1738-9976.
    Detail

    ĎURFINA Lukáš, KŘOUSTEK Jakub, ZEMEK Petr, KOLÁŘ Dušan, HRUŠKA Tomáš, MASAŘÍK Karel and MEDUNA Alexander. Design of an Automatically Generated Retargetable Decompiler. In: 2nd European Conference of COMPUTER SCIENCE (ECCS'11). Puerto De La Cruz, Tenerife: North Atlantic University Union, 2011, pp. 199-204. ISBN 978-1-61804-056-5.
    Detail

    MEDUNA Alexander, VRÁBEL Lukáš and ZEMEK Petr. LL Leftmost k-Linear Scattered Context Grammars. In: AIP Conference Proceedings. Kassandra, Halkidiki: American Institute of Physics, 2011, pp. 833-836. ISBN 978-0-7354-0956-9. ISSN 1551-7616.
    Detail

    ČERMÁK Martin and 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, pp. 168-183. ISBN 978-615-5097-19-5.
    Detail

    ČERMÁK Martin and MEDUNA Alexander. n-Accepting Restricted Pushdown Automata Systems. 7th Doctoral Workshop on Mathematical and Engineering Methods in Computer Science. Brno: Masaryk University, 2011. ISBN 978-80-214-4305-1.
    Detail

    MEDUNA Alexander, VRÁBEL Lukáš and 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, pp. 316-328. ISBN 978-615-5097-19-5.
    Detail

    MEDUNA Alexander and ZEMEK Petr. One-Sided Random Context Grammars. Acta Informatica, vol. 48, no. 3, pp. 149-163. ISSN 0001-5903.
    Detail

    KOUTNÝ Jiří, KŘIVKA Zbyněk and MEDUNA Alexander. Pumping Properties of Path-Restricted Tree-Controlled Languages. In: 7th Doctoral Workshop on Mathematical and Engineering Methods in Computer Science. Brno: Brno University of Technology, 2011, pp. 61-69. ISBN 978-80-214-4305-1.
    Detail

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

    MEDUNA Alexander and ŽIDEK Stanislav. Scattered Context Grammars Generating Sentences Followed by Derivation Trees. Theoretical and Applied Informatics, vol. 2011, no. 2, pp. 97-106. ISSN 1896-5334.
    Detail

    KŘOUSTEK Jakub, ŽIDEK Stanislav, KOLÁŘ Dušan and MEDUNA Alexander. Scattered Context Grammars with Priority. International Journal of Advanced Research in Computer Science, vol. 2, no. 4, pp. 1-6. ISSN 0976-5697.
    Detail

    MEDUNA Alexander, ČERMÁK Martin and MASOPUST Tomáš. Some Power-Decreasing Derivation Restrictions in Grammar Systems. Schedae Informaticae, vol. 2010, no. 19, pp. 23-34. ISSN 0860-0295.
    Detail

    MEDUNA Alexander and ZEMEK Petr. Workspace Theorems for Regular-Controlled Grammars. Theoretical Computer Science, vol. 412, no. 35, pp. 4604-4612. ISSN 0304-3975.
    Detail

  • 2010

    KŘOUSTEK Jakub, ŽIDEK Stanislav, KOLÁŘ Dušan and 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, pp. 165-168. ISBN 978-1-4244-7357-1.
    Detail

    MEDUNA Alexander. Finitely Expandable Deep PDAs. Automata, Formal Languages and Algebraic Systems. Hong Kong: Hong Kong University of Scinece and Technology, 2010, pp. 113-123. ISBN 981-4317-60-8.
    Detail

    GOLDEFUS Filip, MASOPUST Tomáš and MEDUNA Alexander. Left-Forbidding Cooperating Distributed Grammar Systems. Theoretical Computer Science, vol. 411, no. 40, pp. 3661-3667. ISSN 0304-3975.
    Detail

    LUKÁŠ Roman and MEDUNA Alexander. Multigenerative Grammar Systems and Matrix Grammars. Kybernetika, vol. 46, no. 1, pp. 68-82. ISSN 0023-5954.
    Detail

    MEDUNA Alexander and ZEMEK Petr. Regulated Grammars and Their Transformations. Brno: Brno University of Technology, 2010. ISBN 978-80-214-4203-0.
    Detail

    MEDUNA Alexander and TECHET Jiří. Scattered Context Grammars and their Applications. WIT Press, UK. WIT Press, UK: WIT Press, 2010. ISBN 978-1-84564-426-0.
    Detail

  • 2009

    MEDUNA Alexander and TECHET Jiří. An Infinite Hierarchy of Language Families Generated by Scattered Context Grammars with n-Limited Derivations. Theoretical Computer Science, vol. 410, no. 21, pp. 1961-1969. ISSN 0304-3975.
    Detail

    MASOPUST Tomáš and 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-University of Magdeburg, 2009, pp. 235-245. ISBN 978-3-940961-31-0.
    Detail

    MASOPUST Tomáš and MEDUNA Alexander. On context-free rewriting with a simple restriction and its computational completeness. RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, vol. 43, no. 2, pp. 365-378. ISSN 0988-3754.
    Detail

    MASOPUST Tomáš and MEDUNA Alexander. On Pure Multi-Pushdown Automata that Perform Complete Pushdown Pops. Acta Cybernetica, vol. 19, no. 2, pp. 537-552. ISSN 0324-721X.
    Detail

    MEDUNA Alexander and GOLDEFUS Filip. Weak Leftmost Derivations in Cooperative Distributed Grammar Systems. In: MEMICS 09. Brno: Brno University of Technology, 2009, pp. 144-151. ISBN 978-80-87342-04-6.
    Detail

  • 2008

    KOPEČEK Tomáš and MEDUNA Alexander. Conditional Grammars and Their Reduction. Brno: Faculty of Information Technology BUT, 2008. ISBN 978-80-214-3750-0.
    Detail

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

    MEDUNA Alexander and RYCHNOVSKÝ Lukáš. Infinite Language Hierarchy Based on Regular-Regulated Right-Linear Grammars with Start Strings. Philippine Computing Journal, vol. 2008, no. 3, pp. 1-5. ISSN 1908-1995.
    Detail

    MEDUNA Alexander, ed. Conditional grammars are discussed. New Delhi, 2008.
    Detail

    MEDUNA Alexander. New Trends in Algebraic Theory of Automata. In: ICDMA. Bangkok: University of South Australia, 2008, pp. 211-222. ISBN 0-7167-8261-8.
    Detail

    MASOPUST Tomáš and MEDUNA Alexander. On Descriptional Complexity of Partially Parallel Grammars. Fundamenta Informaticae, vol. 87, no. 3, pp. 407-415. ISSN 0169-2968.
    Detail

    MASOPUST Tomáš and MEDUNA Alexander. On Pure Multi-Pushdown Automata that Perform Complete-Pushdown Pops. In: 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, pp. 325-336. ISBN 978-963-311-367-7.
    Detail

    MEDUNA Alexander and TECHET Jiří. Scattered Context Grammars that Erase Nonterminals in a Generalized k-Limited Way. Acta Informatica, vol. 45, no. 7, pp. 593-608. ISSN 0001-5903.
    Detail

    MASOPUST Tomáš, MEDUNA Alexander and ŠIMÁČEK Jiří. Two Power-Decreasing Derivation Restrictions in Generalized Scattered Context Grammars. Acta Cybernetica, vol. 18, no. 4, pp. 783-793. ISSN 0324-721X.
    Detail

  • 2007

    BIDLO Radek, BLATNÝ Petr and MEDUNA Alexander. Automata with Two-Sided Pushdowns Defined over Free Groups Generated by Reduced Alphabets. Kybernetika, vol. 2007, no. 1, pp. 21-35. ISSN 0023-5954.
    Detail

    MEDUNA Alexander and TECHET Jiří. Canonical Scattered Context Generators of Sentences with Their Parses. Theoretical Computer Science, vol. 2007, no. 389, pp. 73-81. ISSN 0304-3975.
    Detail

    BIDLO Radek, BLATNÝ Petr and MEDUNA Alexander. Context-Free and E0L Derivations over Free Groups. Schedae Informaticae, vol. 2007, no. 16, pp. 14-24. ISSN 0860-0295.
    Detail

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

    MASOPUST Tomáš and MEDUNA Alexander. Descriptional Complexity of Grammars Regulated by Context Conditions. In: LATA 2007 Pre-proceedings. Reports of the Research Group on Mathematical Linguistics 35/07, Universitat Rovira i Virgili. Tarragona, Spain, 2007, pp. 403-411.
    Detail

    MASOPUST Tomáš and MEDUNA Alexander. Descriptional complexity of semi-conditional grammars. Information Processing Letters, vol. 104, no. 1, pp. 29-31. ISSN 0020-0190.
    Detail

    KOPEČEK Tomáš, MEDUNA Alexander and ŠVEC Martin. Similar Derivations of Equivalent Grammars. International Journal of Computer Mathematics, vol. 2007, no. 84, pp. 1555-1566. ISSN 0020-7160.
    Detail

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

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

    MEDUNA Alexander, LUKÁŠ Roman and FIALA Jiří. Homogeneous Multicontinuous Grammars and Their Reduction. In: MEMICS 2007 Proceedings. Znojmo: Ing. Zdeněk Novotný, CSc., 2007, pp. 90-96. ISBN 978-80-7355-077-6.
    Detail

    MEDUNA Alexander and TECHET Jiří. Maximal and Minimal Scattered Context Rewriting. In: FCT 2007 Proceedings. Budapest: Springer Verlag, 2007, pp. 412-423. ISSN 0302-9743.
    Detail

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

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

    MEDUNA Alexander and MASOPUST Tomáš. Self-Regulating Finite Automata. Acta Cybernetica, vol. 18, no. 1, pp. 135-153. ISSN 0324-721X.
    Detail

  • 2006

    MEDUNA Alexander. Deep Pushdown Automata. Acta Informatica, vol. 2006, no. 98, pp. 114-124. ISSN 0001-5903.
    Detail

    KŘIVKA Zbyněk, LUKÁŠ Roman and MEDUNA Alexander. Didaktické demonstrace modelů pro popis formálních jazyků. In: Pedagogický software 2006. České Budějovice: Agricultural Faculty, University of South Bohemia, 2006, pp. 54-56. ISBN 80-85645-56-4.
    Detail

    KŘIVKA Zbyněk and MEDUNA Alexander. General Top-Down Parsers Based On Deep Pushdown Expansions. In: Proceedings of 1st International Workshop on Formal Models (WFM'06). Ostrava, 2006, pp. 11-18. ISBN 80-86840-20-4.
    Detail

    KŘIVKA Zbyněk, MEDUNA Alexander and SCHÖNECKER Rudolf. Generation of Languages by Rewriting Systems that Resemble Automata. International Journal of Foundations of Computer Science, vol. 17, no. 5, pp. 1223-1229. ISSN 0129-0541.
    Detail

    MEDUNA Alexander and LUKÁŠ Roman. Multigenerative Grammar Systems. Schedae Informaticae, vol. 2006, no. 15, pp. 175-188. ISSN 0860-0295.
    Detail

    LUKÁŠ Roman and MEDUNA Alexander. Multigenerative Grammar Systems. In: Proceedings of 1st International Workshop - WFM. Přerov, 2006, pp. 19-26. ISBN 80-86840-20-4.
    Detail

    KŘIVKA Zbyněk, MEDUNA Alexander and SCHÖNECKER Rudolf. Reducing Deep Pushdown Automata and Infinite Hierarchy. In: MEMICS 2006 Second Doctoral Workshop on Mathematical and Engineering Methods in Computer Science. Mikulov: Faculty of Information Technology BUT, 2006, pp. 214-221. ISBN 80-214-3287-X.
    Detail

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

  • 2005

    MEDUNA Alexander and LUKÁŠ Roman. A Note on Iteratively Extendable Strings. Rostocker mathematisches kolloquium, vol. 2005, no. 59, pp. 71-73. ISSN 0138-3248.
    Detail

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

    MEDUNA Alexander. Automata and Languages: Theory and Applications. London: Springer Verlag, 2005. ISBN 1-85233-074-0.
    Detail

    BIDLO Radek, BLATNÝ Petr and MEDUNA Alexander. Formal Models over Free Groups. In: PRE-PROCEEDINGS of the 1st Doctoral Workshop on Mathematical and Engineering Methods in Computer Science. Brno: Faculty of Informatics MU, 2005, pp. 193-199.
    Detail

    MEDUNA Alexander and TECHET Jiří. Generation of Sentences with Their Parses: the Case of Propagating Scattered Context Grammars. Acta Cybernetica, vol. 17, no. 1, pp. 11-20. ISSN 0324-721X.
    Detail

    MEDUNA Alexander and ŠVEC Martin. Grammars with Context Conditions and Their Applications. Wiley, New York: WILEY, 2005. ISBN 0-471-71831-9.
    Detail

    LUKÁŠ Roman and MEDUNA Alexander. Multigenerative Grammar Systems. In: Pre-proceedings 1st Doctoral Workshop on Mathematical and Engineering Methods in Comupter Science (MEMICS 2005). Brno: Faculty of Informatics MU, 2005, pp. 85-87.
    Detail

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

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

    LORENC Luboš and MEDUNA Alexander. Self-Reproducing Pushdown Transducers. Kybernetika, vol. 2005, no. 4, pp. 533-539. ISSN 0023-5954.
    Detail

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

    KOPEČEK Tomáš, MEDUNA Alexander and ŠVEC Martin. 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, pp. 59-66. ISBN 80-86840-09-3.
    Detail

  • 2004

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

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

    ELBL Stanislav and MEDUNA Alexander. Grammar Systems of Finite Index. In: Proceedings of 7th International Conference ISIM '04. Ostrava, 2004, pp. 141-146. ISBN 80-85988-99-2.
    Detail

    MEDUNA Alexander and VÍTEK Martin. New language operations in formal language theory. Schedae Informaticae, vol. 2004, no. 13, pp. 123-150. ISSN 0860-0295.
    Detail

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

    KOPEČEK Tomáš and MEDUNA Alexander. Simple-Semi-Conditional Versions of Matrix Grammars with a Reduced Regulating Mechanism. Computing and Informatics, vol. 2004, no. 23, pp. 287-302. ISSN 1335-9150.
    Detail

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

  • 2003

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

    MEDUNA Alexander. Coincidental Extention of Scattered Context Languages. Acta Informatica, vol. 2003, no. 39, pp. 307-314. ISSN 0001-5903.
    Detail

    MEDUNA Alexander and ŠVEC Martin. Descriptional Complexity of Generalized Forbidding Grammars. International Journal of Computer Mathematics, vol. 2003, no. 80, pp. 11-17. ISSN 0020-7160.
    Detail

    MEDUNA Alexander and ŠVEC Martin. Forbidding E0L Systems. Theoretical Computer Science, vol. 2003, no. 306, pp. 449-469. ISSN 0304-3975.
    Detail

    MEDUNA Alexander et al. On the Degree of Scattered Context-Sensitivity. Theoretical Computer Science, vol. 2003, no. 290, pp. 2121-2124. ISSN 0304-3975.
    Detail

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

    MEDUNA Alexander and HRUŠKA Tomáš. Ulice ponese jméno geniálního matematika a brněnského rodáka (o Gödelovi). Události (VUT News), vol. 2003, no. 10, pp. 24-24. ISSN 1211-4421.
    Detail

  • 2002

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

    KOLÁŘ Dušan and MEDUNA Alexander. Homogenous Grammars with a Reduced Number of Non-Context-Free Productions. Information Processing Letters, vol. 2002, no. 81, pp. 253-257. ISSN 0020-0190.
    Detail

    HRUBÝ Martin, MEDUNA Alexander and VURM Petr. Model syntaktické analýzy formálních jazyků. In: Proceedings of XXIVth International Autumn Colloquium ASIS 2002. Ostrava, 2002, pp. 109-114. ISBN 80-85988-77-1.
    Detail

    MEDUNA Alexander and ŠVEC Martin. Reduction of Simple Semi-Conditional Grammars with Respect to the Number of Conditional Productions. Acta Cybernetica, vol. 2002, no. 15, pp. 353-360. ISSN 0324-721X.
    Detail

  • 2001

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

    MEDUNA Alexander and VURM Petr. Multisequential Grammars with Homogeneous Selectors. International Journal of Computer Mathematics, vol. 2001, no. 34, pp. 1-7. ISSN 0020-7160.
    Detail

    MEDUNA Alexander and KOLÁŘ Dušan. One-Turn Regulated Pushdown Automata and Their Reduction. Fundamenta Informaticae, vol. 2001, no. 21, pp. 1001-1007. ISSN 0169-2968.
    Detail

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

  • 2000

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

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

    KOLÁŘ Dušan and MEDUNA Alexander. Regulated Pushdown Automata. Acta Cybernetica, vol. 2000, no. 4, pp. 653-664. ISSN 0324-721X.
    Detail

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

  • 1999

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

  • 1998

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

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

    MEDUNA Alexander. Middle Quotients of Linear Languages. International Journal of Computer Mathematics, pp. 281-289. ISSN 0020-7160.
    Detail

    MEDUNA Alexander. Uniform Rewriting Based on Permutations. International Journal of Computer Mathematics, pp. 57-74. ISSN 0020-7160.
    Detail

  • 1997

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

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

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

  • 1996

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

  • 1995

    MEDUNA Alexander. A Trivial Method of Characterizing the Family of Recursively Enumerable Languages by Scattered Context Grammars. EATCS Bulletin. Leiden: Springer Verlag, 1995, pp. 1-3. ISSN 0252-9742.
    Detail

    MEDUNA Alexander. Symbiotic E0L Systems. Artifical Life:Grammatical Models. Bucharest: unknown, 1995, pp. 122-129.
    Detail

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

  • 1994

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

    GOPALARATNAM Anantha and MEDUNA Alexander. On Semi-Conditional Grammars with Productions Having either Forbidding or Permitting Conditions. Kybernetika, vol. 1994, no. 11, pp. 307-324. ISSN 0023-5954.
    Detail

  • 1993

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

    MEDUNA Alexander. Canonical Scattered Rewriting. International Journal of Computer Mathematics, pp. 122-129. ISSN 0020-7160.
    Detail

    CSUHAJ-VARJÚ Erzsébet and MEDUNA Alexander. Grammars with Context Conditions. Kybernetika, pp. 199-213. ISSN 0023-5954.
    Detail

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

    CROOKS Cynthia, MEDUNA Alexander and ŠÁREK Milan. Syntactic Complexity of Regulated Rewriting. Kybernetika, vol. 1993, no. 30, pp. 177-186. ISSN 0023-5954.
    Detail

  • 1992

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

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

  • 1991

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

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

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

  • 1990

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

    MEDUNA Alexander. Generalized Forbidding Grammars. International Journal of Computer Mathematics, pp. 31-38. ISSN 0020-7160.
    Detail

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

    MEDUNA Alexander. Regulated Rewriting. In: Missourian Annual Conference on Computing. Columbia, 1990, pp. 25-31.
    Detail

  • 1988

    HORVAT George and MEDUNA Alexander. On State Grammars. Acta Cybernetica, vol. 1988, no. 8, pp. 237-245. ISSN 0324-721X.
    Detail

  • 1987

    MEDUNA Alexander. Evaluated Grammars. Acta Cybernetica, vol. 1987, no. 8, pp. 169-176. ISSN 0324-721X.
    Detail

    MEDUNA Alexander. Grammars, Automata, and Compilers. Brno: unknown, 1987.
    Detail

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

  • 1986

    MEDUNA Alexander and ZATLOUKAL Antonín. A General System for Sorting and Print. Prague's Bulletin. Prague: unknown, 1986, pp. 30-38.
    Detail

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

    MEDUNA Alexander and VIČAROVÁ Zdena. Operating Systems II. Olomouc: unknown, 1986.
    Detail

  • 1984

    MEDUNA Alexander and VIČAROVÁ Zdena. Operating Systems I. Olomouc: unknown, 1984.
    Detail

Back to top