Alexander Meduna

From MaRDI portal
Person:385969

Available identifiers

zbMath Open meduna.alexanderDBLP05/2606WikidataQ19609530 ScholiaQ19609530MaRDI QIDQ385969

List of research outcomes

PublicationDate of PublicationType
Automata2024-02-07Paper
https://portal.mardi4nfdi.de/entity/Q61499842024-02-06Paper
On elimination of erasing rules from E0S grammars2023-09-06Paper
CD Grammar Systems with Two Propagating Scattered Context Components Characterize the Family of Context Sensitive Languages2023-08-15Paper
A jumping \(5'\rightarrow 3'\) Watson-Crick finite automata model2022-09-26Paper
Multi-island finite automata and their even computation2022-02-22Paper
https://portal.mardi4nfdi.de/entity/Q50163682021-12-13Paper
Scattered Context Grammars with One Non-Context-Free Production are Computationally Complete2021-11-15Paper
https://portal.mardi4nfdi.de/entity/Q49881572021-05-12Paper
https://portal.mardi4nfdi.de/entity/Q51465282021-01-26Paper
On operations over language families2020-11-02Paper
On double-jumping finite automata and their closure properties2019-07-18Paper
Jumping Scattered Context Grammars2017-12-05Paper
Modern Language Models and Computation2017-12-01Paper
Corrigendum: "Simple Matrix Grammars and Their Leftmost Variants [3"]2016-11-18Paper
Simple Matrix Grammars and Their Leftmost Variants2016-07-27Paper
https://portal.mardi4nfdi.de/entity/Q57404302016-07-26Paper
https://portal.mardi4nfdi.de/entity/Q57404192016-07-26Paper
https://portal.mardi4nfdi.de/entity/Q28163642016-07-08Paper
Jumping Grammars2015-12-11Paper
One-Sided Random Context Grammars: A Survey2015-09-08Paper
A Variant of Pure Two-Dimensional Context-Free Grammars Generating Picture Languages2015-04-17Paper
Solutions to four open problems concerning controlled pure grammar systems2014-10-14Paper
Controlled finite automata2014-08-29Paper
Regulated Grammars and Automata2014-04-01Paper
https://portal.mardi4nfdi.de/entity/Q54016422014-03-11Paper
Generalized one-sided forbidding grammars2013-12-23Paper
One-sided random context grammars with a limited number of right random context rules2013-12-13Paper
Left Random Context ET0L Grammars2013-06-27Paper
JUMPING FINITE AUTOMATA2013-06-06Paper
FINITELY EXPANDABLE DEEP PDAs2013-06-03Paper
On the generation of sentences with their parses by propagating regular-controlled grammars2013-04-17Paper
Rule-restricted Automaton-grammar transducers: Power and Linguistic Applications2013-04-15Paper
One-sided forbidding grammars and selective substitution grammars2013-01-22Paper
An Infinite Hierarchy of Language Families Resulting from Stateless Pushdown Automata with Limited Pushdown Alphabets2012-11-02Paper
One-Sided Random Context Grammars with Leftmost Derivations2012-11-01Paper
https://portal.mardi4nfdi.de/entity/Q28939412012-06-26Paper
Nonterminal complexity of one-sided random context grammars2012-04-26Paper
https://portal.mardi4nfdi.de/entity/Q53898362012-04-23Paper
One-sided random context grammars2012-03-23Paper
Some Power-Decreasing Derivation Restrictions in Grammar Systems2012-02-08Paper
https://portal.mardi4nfdi.de/entity/Q31133032012-02-08Paper
https://portal.mardi4nfdi.de/entity/Q31133052012-02-08Paper
Workspace theorems for regular-controlled grammars2011-09-12Paper
Left-forbidding cooperating distributed grammar systems2010-10-11Paper
https://portal.mardi4nfdi.de/entity/Q35629792010-05-28Paper
https://portal.mardi4nfdi.de/entity/Q53061752010-04-08Paper
Descriptional complexity of semi-conditional grammars2010-03-24Paper
https://portal.mardi4nfdi.de/entity/Q51891092010-03-08Paper
An infinite hierarchy of language families generated by scattered context grammars with \(n\)-limited derivations2009-05-28Paper
On context-free rewriting with a simple restriction and its computational completeness2009-05-06Paper
A simultaneous reduction of several measures of descriptional complexity in scattered context grammars2009-03-23Paper
Scattered context grammars that erase nonterminals in a generalized \(k\)-limited way2009-03-20Paper
https://portal.mardi4nfdi.de/entity/Q36153072009-03-19Paper
https://portal.mardi4nfdi.de/entity/Q36018742009-02-12Paper
https://portal.mardi4nfdi.de/entity/Q53861332008-04-18Paper
https://portal.mardi4nfdi.de/entity/Q54466062008-03-06Paper
Maximal and Minimal Scattered Context Rewriting2008-02-26Paper
Canonical scattered context generators of sentences with their parses2008-01-07Paper
Equivalent language models that closely simulate one another and their illustration in terms ofLsystems2007-11-26Paper
https://portal.mardi4nfdi.de/entity/Q54225592007-10-26Paper
GENERATION OF LANGUAGES BY REWRITING SYSTEMS THAT RESEMBLE AUTOMATA2006-10-16Paper
https://portal.mardi4nfdi.de/entity/Q54740032006-06-23Paper
Deep pushdown automata2006-05-26Paper
https://portal.mardi4nfdi.de/entity/Q56961952006-01-26Paper
https://portal.mardi4nfdi.de/entity/Q57031672005-11-08Paper
Grammars with Context Conditions and Their Applications2005-11-07Paper
https://portal.mardi4nfdi.de/entity/Q46729082005-04-28Paper
Simultaneously One-Turn Two-Pushdown Automata2004-05-27Paper
https://portal.mardi4nfdi.de/entity/Q44653412004-05-27Paper
Forbidding ET0L grammars.2004-03-14Paper
Coincidental extension of scattered context languages2004-03-11Paper
https://portal.mardi4nfdi.de/entity/Q44531982004-03-07Paper
https://portal.mardi4nfdi.de/entity/Q44363562003-12-04Paper
On the degree of scattered context-sensitivity.2003-08-17Paper
Homogeneous grammars with a reduced number of non-context-free products2003-06-24Paper
https://portal.mardi4nfdi.de/entity/Q47993562003-03-19Paper
Descriptional Complexity Of Generalized Forbidding Grammars2003-03-05Paper
https://portal.mardi4nfdi.de/entity/Q47930872003-02-18Paper
https://portal.mardi4nfdi.de/entity/Q43290032002-04-29Paper
https://portal.mardi4nfdi.de/entity/Q27144102001-06-13Paper
https://portal.mardi4nfdi.de/entity/Q27113272001-04-24Paper
Generative power of three-nonterminal scattered context grammars2000-10-26Paper
https://portal.mardi4nfdi.de/entity/Q43189062000-06-21Paper
Terminating left-hand sides of scattered context productions M. Nivat2000-06-04Paper
https://portal.mardi4nfdi.de/entity/Q42691641999-10-31Paper
https://portal.mardi4nfdi.de/entity/Q42693941999-10-31Paper
Middle quotients of linear languages1999-09-15Paper
https://portal.mardi4nfdi.de/entity/Q42582141999-09-01Paper
Prefix pushdown automata and their simplification1999-06-29Paper
Uniform rewriting based on permutations1998-09-07Paper
Six-Nonterminal multi-sequential grammars characterize the family of recursively enumerable languages1998-06-11Paper
Four-nonterminal scattered context grammars characterize the family of recursively enumerable languages1997-03-06Paper
Syntactic complexity of context-free grammars over word monoids1996-11-21Paper
https://portal.mardi4nfdi.de/entity/Q48787171996-05-14Paper
Syntactic complexity of scattered context grammars1995-06-21Paper
A formalization of sequential, parallel, and continuous rewriting1995-02-16Paper
https://portal.mardi4nfdi.de/entity/Q42998611994-09-15Paper
https://portal.mardi4nfdi.de/entity/Q43016861994-08-14Paper
https://portal.mardi4nfdi.de/entity/Q40361761993-05-16Paper
https://portal.mardi4nfdi.de/entity/Q33575531991-01-01Paper
Context free derivations on word monoids1990-01-01Paper
Generalized forbidding grammars1990-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37797621987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37828141987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38011021987-01-01Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Alexander Meduna