Professor Alexander Meduna

Electronic version of curriculum vitae in PDF file.

Personal Data

Birth date: June 27, 1957
Birthplace: Olomouc, the Czech Republic
Citizenship: the Czech Republic

Contact

Professor Alexander Meduna

Address

Department of Information Systems
Faculty of Information Technology 
Brno University of Technology 
Bozetechova 2, 612 66  Brno 
the Czech Republic, Europe

Telecommunication

Phone: +420 541 141 232
Fax: +420 541 141 270

Internet

General Orientation

Theoretical Computer Science

Areas of Special Interest

Formal languages, Compilers

Education

DegreeInstitution
Ph.D. in Computer Science Brno University of Technology
1988 Brno, Czech Republic
M.S. in Computer Science Palacky University
1982 Olomouc, Czech Republic
B.S. in Computer Science Palacky University
1981 Olomouc, Czech Republic

Professional carrier

Position Institution
Full Professor Brno University of Technology
2005 - present Faculty of Information Technology, Department of Information Systems
Brno, Czech Republic
Associate Professor Brno University of Technology
1998 - 2005 Department of Computer Science
Brno, Czech Republic
Senior Researcher Brno University of Technology
1996 - 1998 Computing Center
Brno, Czech Republic
Visiting Assistant Professor University of Missouri–Columbia
1988 - 1996 Department of Computer Science
Columbia, MO, USA
Senior Researcher Brno University of Technology
1985 - 1988 Computing Center
Brno, Czech Republic
Junior Researcher Palacky University
1982 - 1985 Laboratory of Computer Science
Olomouc, Czech Republic

Classes Taught

2003 – present

  • Compiler Construction
  • Formal Languages
  • Modern Theoretical Science

@

Brno University of Technology, 
Department of Computer Science, 
Brno, Czech Republic

1999 – 2005

  • Principles of Compiler Design

@

Brno University of Technology, 
Computing Center, 
Brno, Czech Republic

1999 – 2001

  • Theoretical computer science

@

Brno University of Technology, 
Computing Center, 
Brno, Czech Republic

1988 – 1996

  • CS341 Automata Theory I
  • CS441 Automata Theory II
  • CS343 Compilers I
  • CS443 Compilers II
  • CS345 Principles of Programming Languages
  • CS352 Operating System Theory

@

University of Missouri–Columbia
Department of Computer Science
Columbia, MO, USA

1985 – 1988

  • Automata and compilers Brno University of Technology

@

Computing Center
Brno, Czech Republic

1982 – 1985

  • Compilers Palacky University

@

Laboratory of Computer Science
Olomouc, Czech Republic

Publications

Books

  • Meduna, A., Horáček, P., Tomko, M.: Handbook of Mathematical Models for Languages and Computation. The Institution of Engineering and Technology, 2020
  • Meduna, A., Soukup, O.: Modern Language Models and Computation: Theory with Applications. Springer, 2017
  • Meduna, A., Zemek, P.: Regulated Grammars and Automata. Springer, 2014
  • Meduna, A.: Formal Languages and Computation: Models and Their Application. Taylor & Francis, 2014
  • Meduna, A., Techet, J.: Scattered Context Grammars and Their Applications. WIT Press, UK, 2010
  • Meduna, A., Zemek, P.: Regulated Grammars and Their Transformations, The FIT BUT press, CZ, 2010
  • Meduna, A., Kopecek, T.: Conditional Grammars and Their Reduction. The FIT BUT press, CZ, 2009
  • Meduna, A.: Elements of Compiler Design. Taylor & Francis, 2008 (translated into Chinese in 2009)
  • Meduna, A., Svec, M.: Grammars with Context Conditions and Their Applications. Wiley, 2005
  • Meduna, A.: Automata and Languages: Theory and Applications. Springer, 2000

Book Chapters

  • Meduna, A., Zemek, P.: One-Sided Random Context Grammars: A Survey. Computing with New Resources, Springer Verlag, p. 338-351, 2014
  • Meduna, A., Zemek, P.: One-Sided Random Context Grammars with Leftmost Derivations. Languages Alive - Essays Dedicated to Jürgen Dassow on the Occasion of His 65th Birthday, Springer, p. 160-173, 2012
  • Leupold, P., Meduna, A.: Finitely Expandable Deep PDAs, in Automata, Formal Languages and Algebraic Systems, World Scientific Publishing, p. 113-123, 2010
  • Meduna, A., Kolář, D.: Descriptional Complexity of Parallel Grammars with Respect to the Number of Nonterminals, in Words, Sequences, Languages: Where Computer Science, Biology, and Linguistics Meet (Carlos Martin-Vide, ed.), Kluwer, p. 212-225, 2001
  • Meduna, A., Kolář, D.: 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, p. 212-225, 2000
  • Meduna, A.: On the Number of Nonterminals in Matrix Grammars with Leftmost Derivations, in New Trends in Formal Languages: Control, Cooperation, and Combinatorics, Springer, p. 27-39, 1997
  • Meduna, A.: Symbiotic E0L Systems, in Artificial Life (Gh. Paun, ed.), Black Sea University Press, p. 122-129, 1995
  • Meduna, A.: Matrix Grammars under Leftmost and Rightmost Restrictions, in Mathematical Linguistics and Related Topics (Gh. Paun, ed.), The Publ. House of the Romanian Academy, p. 243 - 257, 1994

Refereed Journal Articles (since 1987)

2021

  • Meduna, A., Křivka, Z.: Scattered Context Grammars with One Non-Context-Free Production are Computationally Complete. Fundamenta Informaticae, (in press)

2020

  • Meduna, A., Martiško, J., Křivka, Z.: CD Grammar Systems with Two Propagating Scattered Context Components Characterize the Family of Context Sensitive Languages. International Journal of Foundations of Computer Science, (in press)
  • Meduna, A., Kocman, R., Křivka, Z.: General CD Grammar Systems and Their Simplification. Journal of Automata, Languages and Combinatorics, 25(1), 2020, p. 37-54

2019

  • Meduna, A., Křivka, Z., Kučera, J.: Jumping Pure Grammars. The Computer Journal, 62(1), 2019, p. 30-41
  • Meduna, A., Krčmář, R., Kövari, A., Beníčková, Z.: On Operations over Language Families. Computer Science Journal of Moldova, 27, 2019, p. 255-282

2018

  • Meduna, A., Charvát, L.: Internally Expandable Pushdown Automata and Their Computational Completeness. Romanian Journal of Information Science and Technology (ROMJIST), 21(3), 2018, p. 232-237
  • Meduna, A., Kocman, R., Křivka, Z.: On Double-Jumping Finite Automata and Their Closure Properties. RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, 52(2), 2018, p. 185-199
  • Meduna, A., Křivka, Z., Kučera, J.: On k#$-Rewriting Systems. Romanian Journal of Information Science and Technology (ROMJIST), 21(3), 2018, p. 278-287

2017

  • Meduna, A., Soukup, O.: Jumping Scattered Context Grammars. Fundamenta Informaticae, 152(1), 2017, p. 51-86
  • Meduna, A., Csuchaj-Varjú, E., Soukup, O.: On Tree-Restricted Regular-Controlled Context-Free Grammars. International Journal of Computer Mathematics: Computer Systems Theory, 2(4), 2017, p. 147-163

2016

  • Meduna, A., Křivka, Z., Zemek, P.: Phrase-Structure Grammars: Normal Forms and Reduction. The Computer Journal, 59(1), 2016, p. 1180-1185
  • Meduna, A., Kučera, J.: On State-Synchronized Automata Systems. Schedae Informaticae, 2015(24), 2016, p. 221-237
  • Meduna, A., Soukup, O.: Simple Matrix Grammars and Their Leftmost Variants. International Journal of Foundations of Computer Science, 27(3), 2016, p. 359-373
  • Meduna, A., Soukup, O., Zemek, P.: Ordered Pure Multi-Pushdown Automata. Theoretical and Applied Informatics, 27(1), 2016, p. 25-47

2015

  • Meduna, A., Křivka, Z.: Jumping Grammars. International Journal of Foundations of Computer Science, 26(6), 2015, p. 709-731

2014

  • Meduna, A., Zemek, P.: One-Sided Random Context Grammars with a Limited Number of Right Random Context Rules. Theoretical Computer Science, 516 (1), 2014, p. 127-132
  • Meduna, A., Zemek, P.: Controlled Finite Automata. Acta Informatica, 51(5), 2014, p. 327-337
  • Meduna, A., Vrábel, L., Zemek, P.: Solutions To Four Open Problems Concerning Controlled Pure Grammar Systems. International Journal of Computer Mathematics, 91(6), 2014, p. 1156-1169
  • Meduna, A., Horáček, P.: New Grammar Systems and Their Application Perspectives. Schedae Informaticae, 2013(22), 2014, p. 47-68
  • Meduna, A., Koutný, J.: On Normal Forms and Erasing Rules in Path-Controlled Grammars. Schedae Informaticae, 2013(22), 2014, p. 9-18
  • Meduna, A., Křivka, Z., Tesař, R.: Alan Mathison Turing - život a dílo [in Czech]. Pokroky matematiky, fyziky a astronomie, 58(2), 2014, p. 1-19

2013

  • Meduna, A., Zemek, P.: Left Random Context ET0L Grammars. Fundamenta Informaticae, 123(3), 2013, p. 289-304
  • Meduna, A., Zemek, P.: On the Generation of Sentences with Their Parses by Propagating Regular-Controlled Grammars. Theoretical Computer Science, 477(1), 2013, p. 67-75
  • Meduna, A., Zemek, P.: Generalized One-Sided Forbidding Grammars. International Journal of Computer Mathematics, 90(2), 2013, p. 172-182

2012

  • Meduna, A., Zemek, P.: Jumping Finite Automata, International Journal of Foundations of Computer Science, 23(7), 2012, p. 1555-1578
  • Meduna, A., Zemek, P.: Controlled Pure Grammar Systems. Journal of Universal Computer Science, 18(14), 2012, p. 2024-2040
  • Meduna, A., Zemek, P.: Nonterminal Complexity of One-Sided Random Context Grammars. Acta Informatica, 49(2), 2012, p. 55-68
  • Meduna, A., Zemek, P.: One-Sided Forbidding Grammars and Selective Substitution Grammars. International Journal of Computer Mathematics, 89(5), 2012, p. 586-596
  • Čermák, M., Koutný, J., Meduna, A.: Parsing Based on n-Path Tree-Controlled Grammars. Theoretical and Applied Informatics, 2011(23), 2012, p. 213-228
  • Čermák, M., Horáček, P., Meduna, A.: Rule-restricted automaton-grammar tranduscers: Power and linguistic applications. Mathematics for Applications, 1(1), 2012, p. 13-35
  • Horáček, P., Meduna, A.: Synchronous Versions of Regulated Grammars: Generative Power and Linguistic Applications. Theoretical and Applied Informatics, 24(3), 2012, p. 175-190
  • Koutný, J., Meduna, A.: Tree-controlled Grammars with Restrictions Placed upon Cuts and Paths. Kybernetika, 48(1), 2012, p. 165-175

2011

  • Kroustek, J., Zidek, S., Kolar, D., Meduna, A.: Scattered Context Grammars with Priority. International Journal of Advanced Research in Computer Science, 2(4), 2011, p. 1-6
  • Meduna, A., Zemek, P.: One-Sided Random Context Grammars. Acta Informatica, 48(3), 2011, p. 149-163
  • Meduna, A., Zemek, P.: Workspace Theorems for Regular-Controlled Grammars. Theoretical Computer Science, 412(35), 2011, p. 4604-4612

2010

  • Meduna, A., Cermak, M., Masopust, T.: Some Power-Decreasing Derivation Restrictions in Grammar Systems. Schedae Informaticae, 19, 2010, p. 23-34
  • Goldefus, F., Masopust, T., Meduna, A.: Left-Forbidding Cooperating Distributed Grammar Systems. Theoretical Computer Science, 411(40), 2010, p. 3661-3667
  • Meduna, A., Lukas, R.: Multigenerative Grammar Systems and Matrix Grammars. Kybernetika, 46(1), 2010, p. 68-82

2000 - 2009

  • Meduna, A., Techet, J.: An Infinite Hierarchy of Language Families Generated by Scattered Context Grammars with n-Limited Derivations. Theoretical Computer Science, 410(21), 2009, p. 1961-1969
  • Masopust, T., Meduna, A.: On context-free rewriting with a simple restriction and its computational completeness. RAIRO – Theoretical Informatics and Applications, 43(2), 2009, p. 365-378
  • Masopust, T., Meduna, A.: On Pure Multi-Pushdown Automata that Perform Complete Pushdown Pops. Acta Cybernetica, 19(2), 2009, p. 537-552
  • Meduna, A., Rychnovsky, L.: Infinite Language Hierarchy Based on Regular-Regulated Right-Linear Grammars with Start Strings. Philippine Computing Journal, 3, 2008, p. 1-5
  • Meduna, A., Techet, J.: Scattered Context Grammars that Erase Nonterminals in a Generalized k-Limited Way. Acta Informatica, 45(7), 2008, p. 593-608
  • Masopust, T., Meduna, A., Simacek, J.: Two Power-Decreasing Derivation Restrictions in Generalized Scattered Context Grammars. Acta Cybernetica, 18(4), 2008, p. 783-793
  • Masopust, T., Meduna, A.: On Descriptional Complexity of Partially Parallel Grammars. Fundamenta Informaticae, 87(3), 2008, p. 407-415
  • Bidlo, R., Blatny, P., Meduna, A.: Automata with Two-Sided Pushdowns Defined over Free Groups Generated by Reduced Alphabets. Kybernetika, 43(3), 2007, p. 265-278
  • Bidlo, R., Blatny, P., Meduna, A.: Context-Free and E0L Derivations over Free Groups. Schedae Informaticae, 16, 2007, p. 14-24
  • Kopecek, T., Meduna, A., Svec, M.: Equivalent language models that closely simulate one another and their illustration in terms of L systems. International Journal of Computer Mathematics, 84(11) 2007, p. 1555-1566
  • Meduna, A., Masopust, T.: Descriptional Complexity of Semi-Conditional Grammars. Information Processing Letters, 104(1), 2007, p. 29-31
  • Meduna, A., Masopust, T.: Self-Regulating Finite Automata. Acta Cybernetica, 18(1), 2007, p. 135-153
  • Meduna, A., Techet, J.: Canonical Scattered Context Generators of Sentences with Their Parses. Theoretical Computer Science, 389, 2007, p. 73-81
  • Meduna, A., Krivka, Z., Schonecker, R.: Generation of Languages by Rewriting Systems that Resemble Automata. International Journal of Foundations of Computer Science, p. 1223-1229, 2006
  • Meduna, A., Lukas, R.: Multigenerative Grammar Systems. Schedae Informatice, p. 11, 2006
  • Meduna, A.: Deep Pushdown Automata. Acta Informatica, p. 114-124, 2006
  • Meduna, A., Lorenc, L.: Self-Reproducing Pushdown Transducers. Kybernetika, p. 533-539, 2005
  • Meduna, A., Techet, J.: Generation of Sentences with Their Parses: the Case of Propagating Scattered Context Grammars. Acta Cybernetica, p. 11-20, 2005
  • Meduna, A., Kopecek, T.: Simple-Semi-Conditional Versions of Matrix Grammars with a Reduced Regulating Mechanism. Computing and Informatics, p. 287-302, 2004
  • Meduna, A., Vitek, M.: New language operations in formal language theory. Schedae Informaticae, p. 123-150, 2004
  • Meduna, A.: A Simultaneous Reduction of Several Measures of Descriptional Complexity in Scattered Context Grammars. Information Processing Letters, p. 214-219, 2003
  • Meduna, A.: On the Degree of Scattered Context-Sensitivity, Theoretical Computer Science, p. 2121-2124, 2003
  • Meduna, A., Svec, M.: Descriptional Complexity of Generalized Forbidding Grammars. International Journal of Computer Mathematics, p. 11-17, 2003
  • Meduna, A., Svec, M.: Forbidding E0L Systems. Theoretical Computer Science, p. 256-276, 2003
  • Meduna, A.: Coincidental Extention of Scattered Context Languages. Acta Informatica, p. 307-314, 2003
  • Meduna, A.: Simultaneously One-Turn Two-Pushdown Automata. International Journal of Computer Mathematics, p. 1-9, 2003
  • Meduna, A.: Two-Way Metalinear PC Grammar Systems and Their Descriptional Complexity. Acta Cybernetica, p. 126-137, 2003
  • Meduna, A., Kolar, D.: Homogenous Grammars with a Reduced Number of Non-Context-Free Productions. Information Processing Letters, p. 253-257, 2002
  • Meduna, A., Kolar, D.: One-Turn Regulated Pushdown Automata and Their Reduction. Fundamenta Informaticae, p. 399-405, 2002
  • Meduna, A., Svec, M.: Reduction of Simple Semi-Conditional Grammars with Respect to the Number of Conditional Productions. Acta Cybernetica, p. 353-360, 2002
  • Meduna, A.: Descriptional Complexity of Scattered Rewriting and Multirewriting: An Overview. Journal of Automata, Languages and Combinatorics, p. 571-577, 2002
  • Meduna, A.: Simultaneously One-Turn Two-Pushdown Automata. International Journal of Computer Mathematics, p. 111-121, 2002
  • Meduna, A., Vurm Petr: Multisequential Grammars with Homogeneous Selectors. International Journal of Computer Mathematics, p. 6, 2001
  • Meduna, A.: Descriptional Complexity of Partially Parallel Grammars. DCAGRS, p. 15-21, 2001
  • Meduna, A.: Uniform Generation of Languages by Scattered Context Grammars, Fundamenta Informaticae, p. 231-235, 2001
  • Meduna, A., Kolar, D.: Regulated Pushdown Automata. Acta Cybernetica, p. 653-664, 2000
  • Meduna, A.: Context-Free Multirewriting with a Reduced Number of Nonterminals, p. 164, 2000
  • Meduna, A.: Generative Power of Three-Nonterminal Scattered Context Grammars. Theoretical Computer Science, p. 625-631, 2000
  • Meduna, A.: Terminating Left-Hand Sides of Scattered Context Grammars. Theoretical Computer Science, p. 423-427, 2000

1990 - 1999

  • Meduna, A.: Prefix Pushdown Automata. International Journal of Computer Mathematics, p. 164-182, 1999
  • Meduna, A.: Descriptional Complexity of Multi-Continues Grammars. Acta Cybernetica, p. 375-384, 1998
  • Meduna, A.: Economical Transformations of Scattered Context Grammars to Phrase-Structure Grammars. Acta Cybernetica, p. 225-242, 1998
  • Meduna, A.: Middle Quotients of Linear Languages. International Journal of Computer Mathematics, p. 281-289, 1998
  • Meduna, A.: Uniform Rewriting Based on Permutations. International Journal of Computer Mathematics, p. 57-74, 1998
  • Meduna, A.: Six-Nonterminal Multi-Sequential Grammars Characterize the Family of Recursively Enumerable Languages. International Journal of Computer Mathematics, p. 179-189, 1997
  • Meduna, A.: Four-Nonterminal Scattered Context Grammars Characterize the Family of Recursively Enumerable Languages. International Journal of Computer Mathematics, p. 465-474, 1996
  • Meduna, A.: Syntactic Complexity of Context-Free Grammars over Word Monoids. Acta Informatica, p. 457-474, 1996
  • Meduna, A.: A Trivial Method of Characterizing the Family of Recursively Enumerable Languages by Scattered Context Grammars. EATCS Bulletin, p. 104-106, 1995
  • Meduna, A.: Symbiotic E0L Systems. Artificial Life:Grammatical Models, p. 122-129, 1995
  • Meduna, A.: Syntactic Complexity of Scattered Context Grammars. Acta Informatica, p. 126-139, 1995
  • Meduna, A., Gopalaratnam, A.: On Semi-Conditional Grammars with Productions Having either Forbidding or Permitting Conditions. Kybernetika, p. 309-323, 1994
  • Meduna, A.: Matrix Grammars under Leftmost and Rightmost Restrictions. Mathematical Linguistics and Related Topics, p. 243-257, 1994
  • Meduna, A., Crooks, C., Sarek, M.: Syntactic Complexity of Regulated Rewriting. Kybernetika, p. 177-186, 1993
  • Meduna, A., Csuhaj-Varju, E.: Grammars with Context Conditions. Kybernetika, p. 199-213, 1993
  • Meduna, A.: Canonical Scattered Rewriting. International Journal of Computer Mathematics, p. 122-129, 1993
  • Meduna, A.: A Formalization of Sequential, Parallel, and Continuous Rewriting. International Journal of Computer Mathematics, p. 24-32, 1992
  • Meduna, A.: Symbiotic E0L Systems. Acta Cybernetica, p. 164-172, 1992
  • Meduna, A.: Controlled Systolic Automata. Parallel Computation in the Midwestern Academic Environment, p. 56-66, 1991
  • Meduna, A.: Generalized Forbidding Grammars. International Journal of Computer Mathematics, p. 31-38, 1990
  • Meduna, A.: Global Context Conditional Grammars. Journal of Automata, Languages and Combinatorics, p. 31-38, 1990
  • Meduna, A.: Parallel Compilers Based on L Systems. Parallel Computation in the Midwestern Academic Environment, p. 215-224, 1990
  • Meduna, A.: Regulated Rewriting. Missourian Annual Conference on Computing, p. 25-31, 1990

1987 - 1989

  • Meduna, A., Horvath, G.: On State Grammars. Acta Cybernetica, p. 4-14, 1988
  • Meduna, A.: Context-Free Derivations on Word Monoids. Acta Informatica, p. 781-786, 1988
  • Meduna, A.: Evaluated Grammars. Acta Cybernetica, p. 169-176, 1987
vita/vita.txt · Last modified: 2021/03/24 14:04 by krivka
 
Except where otherwise noted, content on this wiki is licensed under the following license: CC Attribution-Noncommercial-Share Alike 4.0 International
Recent changes RSS feed Donate Powered by PHP Valid XHTML 1.0 Valid CSS Driven by DokuWiki