Alexander Meduna
#97,995
Most Influential Person Now
Czech computer scientist
Alexander Meduna's AcademicInfluence.com Rankings
Alexander Medunacomputer-science Degrees
Computer Science
#3440
World Rank
#3610
Historical Rank
Theoretical Computer Science
#63
World Rank
#63
Historical Rank
Database
#8878
World Rank
#9331
Historical Rank
Download Badge
Computer Science
Alexander Meduna's Degrees
- PhD Computer Science Charles University
Similar Degrees You Can Earn
Why Is Alexander Meduna Influential?
(Suggest an Edit or Addition)According to Wikipedia, Alexander Meduna is a theoretical computer scientist and expert on compiler design, formal languages and automata. He is a professor of Computer Science at the Brno University of Technology. Formerly, he taught theoretical computer science at various European and American universities, including the University of Missouri, where he spent a decade teaching advanced topics of formal language theory. He is the author of several books and over sixty papers related to the subject matter.
Alexander Meduna's Published Works
Number of citations in a given year to any of this author's works
Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author
Published Works
- Automata and languages - theory and applications (2000) (136)
- Automata and Languages (2000) (118)
- Jumping Finite Automata (2012) (68)
- Regulated Grammars and Automata (2014) (34)
- Design of a Retargetable Decompiler for a Static Platform-Independent Malware Analysis (2011) (32)
- Generalized forbidding grammars (1990) (29)
- On Semi-Conditional Grammars with Productions Having either Forbidding or Permitting Conditions (1994) (27)
- Scattered Context Grammars and Their Applications (2010) (27)
- Regulated Pushdown Automata (2000) (25)
- Formal Languages and Computation: Models and Their Applications (2014) (24)
- Elements of Compiler Design (2007) (23)
- Generative power of three-nonterminal scattered context grammars (2000) (23)
- Descriptional Complexity Of Generalized Forbidding Grammars (2003) (22)
- Deep pushdown automata (2006) (22)
- Simultaneously One-Turn Two-Pushdown Automata (2003) (22)
- A trivial method of characterizing the family of recursively enumerable languages by scattered context grammars (1995) (22)
- Reduction of Simple Semi-Conditional Grammars with Respect to the Number of Conditional Productions (2002) (21)
- Grammars with Context Conditions and Their Applications (2005) (20)
- A simultaneous reduction of several measures of descriptional complexity in scattered context grammars (2003) (18)
- On the degree of scattered context-sensitivity (2003) (16)
- One-sided random context grammars (2011) (15)
- Four-nonterminal scattered context grammars characterize the family of recursively enumerable languages (1997) (15)
- Forbidding ET0L grammars (2003) (14)
- On state grammars (1988) (13)
- On the Number of Nonterminals in Matrix Grammars with Leftmost Derivations (1997) (13)
- Syntactic complexity of scattered context grammars (1995) (12)
- Multigenerative Grammar Systems (2006) (12)
- Canonical scattered context generators of sentences with their parses (2007) (12)
- Terminating left-hand sides of scattered context productions M. Nivat (2000) (12)
- Left-forbidding cooperating distributed grammar systems (2010) (12)
- One-Turn Regulated Pushdown Automata and Their Reduction (2002) (11)
- Two-Way Metalinear PC Grammar Systems and Their Descriptional Complexity (2004) (11)
- Uniform rewriting based on permutations (1998) (11)
- Generalized one-sided forbidding grammars (2013) (11)
- A jumping 5' → 3' Watson-Crick finite automata model (2018) (10)
- One-sided forbidding grammars and selective substitution grammars (2012) (10)
- Symbiotic E0L systems (1992) (10)
- Nonterminal complexity of one-sided random context grammars (2012) (10)
- On Parallel Versions of Jumping Finite Automata (2015) (9)
- Descriptional complexity of semi-conditional grammars (2007) (9)
- Context free derivations on word monoids (1990) (9)
- One-Sided Random Context Grammars with Leftmost Derivations (2012) (9)
- Descriptional Complexity of Grammars Regulated by Context Conditions (2007) (9)
- Grammars with Context Conditions and Their Applications: Meduna/Grammars (2005) (9)
- Generation of Languages by Rewriting Systems that Resemble Automata (2006) (9)
- Descriptional Complexity of Three-Nonterminal Scattered Context Grammars: An Improvement (2009) (8)
- Jumping Grammars (2015) (8)
- A Variant of Pure Two-Dimensional Context-Free Grammars Generating Picture Languages (2014) (8)
- On context-free rewriting with a simple restriction and its computational completeness (2009) (8)
- Tree-controlled grammars with restrictions placed upon cuts and paths (2012) (8)
- Six-Nonterminal multi-sequential grammars characterize the family of recursively enumerable languages (1997) (8)
- Multigenerative grammar systems and matrix grammars (2010) (8)
- RULE-RESTRICTED AUTOMATON-GRAMMAR TRANSDUCERS: POWER AND LINGUISTIC APPLICATIONS (2012) (8)
- Design of an automatically generated retargetable decompiler (2011) (7)
- Simple-Semi-Conditional Versions of Matrix Grammars with a Reduced Regulating Mechanism (2004) (7)
- Self-Regulating Finite Automata (2007) (7)
- On Descriptional Complexity of Partially Parallel Grammars (2008) (7)
- Global Context Conditional Grammars (1991) (7)
- Generation of Sentences with Their Parses: the Case of Propagating Scattered Context Grammars (2005) (7)
- Left Random Context ET0L Grammars (2013) (7)
- One-sided random context grammars with a limited number of right random context rules (2014) (6)
- n-Accepting Restricted Pushdown Automata Systems (2011) (6)
- Chapter 17 Jumping Finite Automata (2014) (6)
- Maximal and Minimal Scattered Context Rewriting (2007) (6)
- On double-jumping finite automata and their closure properties (2018) (5)
- Homogeneous grammars with a reduced number of non-context-free productions (2002) (5)
- Applications and Implementation (2005) (5)
- Synchronous versions of regulated grammars : generative power and linguistic applications (2012) (5)
- Economical Transformations of Phrase-Structure Grammars to Scattered Context Grammars (1998) (5)
- Uniform Generation of Languages by Scattered Context Grammars (2001) (5)
- Scattered context grammars that erase nonterminals in a generalized k-limited way (2008) (5)
- Parsing based on n-path tree - controlled grammars (2011) (5)
- Descriptional Complexity of Scattered Rewriting and Multirewriting: An Overview (2002) (5)
- Scattered context grammars generating sentences followed by derivation tree (2011) (4)
- Coincidental extension of scattered context languages (2003) (4)
- On Nondeterminism in Programmed Grammars (2011) (4)
- FINITELY EXPANDABLE DEEP PDAs (2010) (4)
- Workspace theorems for regular-controlled grammars (2011) (4)
- Syntactic complexity of context-free grammars over word monoids (1996) (4)
- A formalization of sequential, parallel, and continuous rewriting (1993) (4)
- On the generation of sentences with their parses by propagating regular-controlled grammars (2013) (4)
- Automata with two-sided pushdowns defined over free groups generated by reduced alphabets (2007) (4)
- Evaluated grammars (1977) (4)
- Reduction of Scattered Context Generators of Sentences Preceded by Their Leftmost Parses (2007) (4)
- Descriptional Complexity of Multi-Continuous Grammars (1998) (4)
- Chapter 2 Mathematical Background (2014) (3)
- Generalized #-Rewriting Systems of Finite Index (2007) (3)
- An infinite hierarchy of language families generated by scattered context grammars with n-limited derivations (2009) (3)
- Grammars without context conditions (1994) (3)
- Controlled finite automata (2014) (3)
- Descriptional Complexity of Multi-Parallel Grammars with Respect to the Number of Nonterminals (2003) (3)
- Two Power-Decreasing Derivation Restrictions in Generalized Scattered Context Grammars (2008) (3)
- Solutions to four open problems concerning controlled pure grammar systems (2014) (3)
- Jumping Scattered Context Grammars (2017) (3)
- Context-Free and E0L Derivations over Free Groups (2007) (3)
- Some Power-Decreasing Derivation Restrictions in Grammar Systems (2010) (3)
- LL Leftmost k‐Linear Scattered Context Grammars (2011) (3)
- New Language Operations in Formal Language Theory (2004) (3)
- On Normal Forms and Erasing Rules in Path Controlled Grammars (2014) (2)
- Coincidental extension of scattered context languages (2003) (2)
- Advanced static analysis for decompilation using scattered context grammars (2011) (2)
- Syntactic complexity of regulated rewriting (1994) (2)
- Controlled Pure Grammar Systems (2012) (2)
- A note on exponential density of ETOL languages (1986) (2)
- Exploitation of scattered context grammars to model VLIW instruction constraints (2010) (2)
- Pattern matching in tree structures (2014) (2)
- Equivalent language models that closely simulate one another and their illustration in terms of L systems (2007) (2)
- On Pure Multi-Pushdown Automata that Perform Complete Pushdown Pops (2009) (2)
- Scattered Context Grammars with One Non-Context-Free Production are Computationally Complete (2021) (1)
- New Grammar Systems and Their Application Perspectives (2014) (1)
- Regulated Automata and Computation (2017) (1)
- An Infinite Hierarchy of Language Families Resulting from Stateless Pushdown Automata with Limited Pushdown Alphabets (2012) (1)
- Modern Language Models and Computation (2017) (1)
- Finite and Pushdown Transducers (2000) (1)
- Context-free Multirewriting with a Reduced Number of Nonterminals (1)
- A Reduction of Finitely Expandable Deep Pushdown Automata (2018) (1)
- Prefix pushdown automata and their simplification (1999) (1)
- General Multigenerative Grammar Systems (2007) (1)
- Middle quotients of linear languages (1999) (1)
- On double-jumping finite automata (2016) (1)
- Special Types of Context-Free Languages and Their Models (2000) (0)
- Context Conditions Placed on the Neighborhood of Rewritten Symbols (2005) (0)
- On k # $-Rewriting Systems (2018) (0)
- Properties of Regular Languages (2000) (0)
- Grammatical Transformations and Derivation Simulations (2005) (0)
- General CD Grammar Systems and Their Simplification (2020) (0)
- Conclusive Tree-Controlled Grammars (2022) (0)
- Concluding and Bibliographical Notes (2005) (0)
- Context-free grammars (2019) (0)
- Chapter 16 Automata Regulated by Control Languages (2014) (0)
- Controlled finite automata (2014) (0)
- Parallel Grammars and Computation (2017) (0)
- Applications and Their Perspectives in General (2017) (0)
- Chapter 8 Extension of Languages Resulting from Regulated Grammars (2014) (0)
- Chapter 10 Regulated ET0L Grammars (2014) (0)
- Context Conditions Placed on the Use of Productions (2005) (0)
- One-Sided Random Context Grammars: A Survey (2014) (0)
- Classical models for languages and computation (2019) (0)
- Context Conditions Placed on Derivation Domains (2005) (0)
- Applications in Computational Linguistics (2017) (0)
- Basic mathematical concepts (2019) (0)
- Chapter 7 On Erasing Rules and Their Elimination (2014) (0)
- Relations and language models (2019) (0)
- Preliminaries and Definitions (2005) (0)
- Computational Completeness Resulting from Scattered Context Grammars Working Under Various (2014) (0)
- Simple Matrix Grammars and Their Leftmost Variants (2016) (0)
- Deep Pushdown Automata and New Stack Structures (2017) (0)
- Applications of Turing Machines: Theory of Computation (2014) (0)
- Jumping Grammars and Discontinuous Computation (2017) (0)
- Language-Generating Automata and State-Controlled Computation (2017) (0)
- Chapter 20 Case Studies (2014) (0)
- Chapter 3 Rudiments of Formal Language Theory (2014) (0)
- Jumping Pure Grammars (2019) (0)
- Properties of Context-free Languages (2000) (0)
- Chapter 12 Parallel Rewriting Over Word Monoids (2014) (0)
- On Vertical Grammatical Restrictions that Produce an Infinite Language Hierarchy (2007) (0)
- Self-reproducing pushdown transducers (2005) (0)
- Regulated Grammars and Computation (2017) (0)
- Regulated Grammars and Automata : The Gist with a Case Study (New contact points of algebraic systems, logics, languages, and computer sciences) (2015) (0)
- A jumping $$5'\rightarrow 3'$$ 5 ′ → 3 ′ (2022) (0)
- A jumping $5'\rightarrow 3'$ Watson-Crick finite automata model (2022) (0)
- On tree-restricted regular-controlled context-free grammars (2017) (0)
- Obituary for David John Evans (1928–2005) (2007) (0)
- Corrigendum: "Simple Matrix Grammars and Their Leftmost Variants [3]" (2016) (0)
- Ordered Pure Multi-Pushdown Automata (2015) (0)
- Nonterminal complexity of one-sided random context grammars (2012) (0)
- Multi-island finite automata and their even computation (2022) (0)
- Context-dependent grammars (2019) (0)
- Symbiotic EOL Systems (1992) (0)
- Chapter 9 Sequential Rewriting Over Word Monoids (2014) (0)
- Chapter 11 Uniform Regulated Rewriting in Parallel (2014) (0)
- Chapter 6 One-Sided Versions of Random Context Grammars (2014) (0)
- Chapter 14 Controlled Pure Grammar Systems (2014) (0)
- Applications in general (2019) (0)
- Models for Regular Languages (2000) (0)
- Applications in biology (2019) (0)
- On State-Synchronized Automata Systems (2015) (0)
- Jumping Automata and Discontinuous Computation (2017) (0)
- Alternative models for languages and computation (2019) (0)
- Formal Language Theory: Basics (2017) (0)
- Chapter 18 Deep Pushdown Automata (2014) (0)
- Algebra, Grammars, and Computation (2017) (0)
- Multisequential Grammars with Homogeneous Selectors (2001) (0)
- Phrase-Structure Grammars: Normal Forms and Reduction (2016) (0)
- EVALUATING YONA LANGUAGE (2021) (0)
- Chapter 19 Applications: Overview (2014) (0)
- Internally Expandable Pushdown Automata and Their Computational Completeness (2018) (0)
- Dual Grammars (2003) (0)
- Applications in syntax analysis: natural languages (2019) (0)
- Applications in syntax analysis: programming languages (2019) (0)
- Chapter 4 Context-Based Grammatical Regulation (2014) (0)
- On Operations over Language Families (2019) (0)
- Proceedings of the 2nd International Workshop on Formal Models WFM'07, Hradec nad Moravicí, Czech Republic, April 23-25, 2007 (2007) (0)
- Chapter 21 Concluding Remarks (2014) (0)
- Algebra, Automata, and Computation (2017) (0)
- Chapter 15 Self-Regulating Automata (2014) (0)
- CD Grammar Systems with Two Propagating Scattered Context Components Characterize the Family of Context Sensitive Languages (2017) (0)
- Relations and functions (2019) (0)
- On Elimination of Erasing Rules from E0S Grammars (2022) (0)
- Parallel grammatical models (2019) (0)
- Denotations of Language Families (2005) (0)
- Multigenerative Grammar Systems and Parallel Computation (2017) (0)
- On the Generative Power of CD Grammar Systems With Scattered Context Components (2016) (0)
- Sets, sequences, and languages (2019) (0)
- Chapter 22 Summary (2014) (0)
- Applications in Computational Biology (2017) (0)
- Mathematical Foundations of Formal Language Theory (2013) (0)
- Automata (2023) (0)
- Models for Context-Free Languages (2000) (0)
- Chapter 13 Regulated Multigenerative Grammar Systems (2014) (0)
- Handbook of Mathematical Models for Languages and Computation (2020) (0)
- Chapter 5 Rule-Based Grammatical Regulation (2014) (0)
- Forbidding ET 0 L grammars (2003) (0)
This paper list is powered by the following services:
Other Resources About Alexander Meduna
What Schools Are Affiliated With Alexander Meduna?
Alexander Meduna is affiliated with the following schools:
