Alexander Meduna
Orcid: 0000-0002-2341-0606
According to our database1,
Alexander Meduna
authored at least 109 papers
between 1986 and 2023.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
On csauthors.net:
Bibliography
2023
Proceedings of the 13th International Workshop on Non-Classical Models of Automata and Applications, 2023
WorldScientific, ISBN: 9789811278143, 2023
2022
CD Grammar Systems with Two Propagating Scattered Context Components Characterize the Family of Context Sensitive Languages.
Int. J. Found. Comput. Sci., 2022
Proceedings of the Proceedings 12th International Workshop on Non-Classical Models of Automata and Applications, 2022
Acta Informatica, 2022
2021
Scattered Context Grammars with One Non-Context-Free Production are Computationally Complete.
Fundam. Informaticae, 2021
2020
2019
2018
RAIRO Theor. Informatics Appl., 2018
A jumping 5' → 3' Watson-Crick finite automata model.
Proceedings of the Tenth Workshop on Non-Classical Models of Automata and Applications, 2018
2017
Int. J. Comput. Math. Comput. Syst. Theory, 2017
CD Grammar Systems with Two Propagating Scattered Context Components Characterize the Family of Context Sensitive Languages.
Proceedings of the Proceedings 15th International Conference on Automata and Formal Languages, 2017
Springer, ISBN: 978-3-319-63099-1, 2017
2016
Int. J. Found. Comput. Sci., 2016
Int. J. Found. Comput. Sci., 2016
On double-jumping finite automata.
Proceedings of the Eighth Workshop on Non-Classical Models of Automata and Applications, 2016
2015
2014
One-sided random context grammars with a limited number of right random context rules.
Theor. Comput. Sci., 2014
Int. J. Comput. Math., 2014
A Variant of Pure Two-Dimensional Context-Free Grammars Generating Picture Languages.
Proceedings of the Combinatorial Image Analysis - 16th International Workshop, 2014
Proceedings of the Computing with New Resources, 2014
2013
On the generation of sentences with their parses by propagating regular-controlled grammars.
Theor. Comput. Sci., 2013
2012
Kybernetika, 2012
Int. J. Comput. Math., 2012
An Infinite Hierarchy of Language Families Resulting from Stateless Pushdown Automata with Limited Pushdown Alphabets.
Proceedings of the Descriptional Complexity of Formal Systems, 2012
Proceedings of the Languages Alive, 2012
2011
Design of a Retargetable Decompiler for a Static Platform-Independent Malware Analysis.
Proceedings of the Information Security and Assurance - International Conference, 2011
On Nondeterminism in Programmed Grammars.
Proceedings of the Automata and Formal Languages, 13th International Conference, 2011
n-Accepting Restricted Pushdown Automata Systems.
Proceedings of the Automata and Formal Languages, 13th International Conference, 2011
2010
2009
An infinite hierarchy of language families generated by scattered context grammars with n-limited derivations.
Theor. Comput. Sci., 2009
On context-free rewriting with a simple restriction and its computational completeness.
RAIRO Theor. Informatics Appl., 2009
Descriptional Complexity of Three-Nonterminal Scattered Context Grammars: An Improvement
Proceedings of the Proceedings Eleventh International Workshop on Descriptional Complexity of Formal Systems, 2009
Acta Cybern., 2009
2008
Fundam. Informaticae, 2008
Two Power-Decreasing Derivation Restrictions in Generalized Scattered Context Grammars.
Acta Cybern., 2008
Scattered context grammars that erase nonterminals in a generalized <i>k</i> -limited way.
Acta Informatica, 2008
2007
Theor. Comput. Sci., 2007
Automata with two-sided pushdowns defined over free groups generated by reduced alphabets.
Kybernetika, 2007
Descriptional Complexity of Grammars Regulated by Context Conditions.
Proceedings of the LATA 2007. Proceedings of the 1st International Conference on Language and Automata Theory and Applications., 2007
Proceedings of the 2nd International Workshop on Formal Models WFM'07, 2007
Proceedings of the 2nd International Workshop on Formal Models WFM'07, 2007
Proceedings of the 2nd International Workshop on Formal Models WFM'07, 2007
Proceedings of the Fundamentals of Computation Theory, 16th International Symposium, 2007
Reduction of Scattered Context Generators of Sentences Preceded by Their Leftmost Parses.
Proceedings of the 9th International Workshop on Descriptional Complexity of Formal Systems - DCFS 2007, High Tatras, Slovakia, July 20, 2007
Descriptional Complexity of Generalized Forbidding Grammars.
Proceedings of the 9th International Workshop on Descriptional Complexity of Formal Systems - DCFS 2007, High Tatras, Slovakia, July 20, 2007
2006
Int. J. Found. Comput. Sci., 2006
2005
Generation of Sentences with Their Parses: the Case of Propagating Scattered Context Grammars.
Acta Cybern., 2005
2004
Simple-Semi-Conditional Versions of Matrix Grammars with a Reduced Regulating Mechanism.
Comput. Artif. Intell., 2004
Acta Cybern., 2004
2003
A simultaneous reduction of several measures of descriptional complexity in scattered context grammars.
Inf. Process. Lett., 2003
Int. J. Comput. Math., 2003
Acta Informatica, 2003
Descriptional Complexity of Multi-Parallel Grammars with Respect to the Number of Nonterminals.
Proceedings of the Grammars and Automata for String Processing: From Mathematics and Computer Science to Biology, 2003
2002
J. Autom. Lang. Comb., 2002
Inf. Process. Lett., 2002
Reduction of Simple Semi-Conditional Grammars with Respect to the Number of Conditional Productions.
Acta Cybern., 2002
2001
Fundam. Informaticae, 2001
Descriptional Complexity of Partially Parallel Grammars.
Proceedings of the Third International Workshop on Descriptional Complexity of Automata, Grammars and Related Structures - DCAGRS 2001, Vienna, Austria, July 20, 2001
2000
Theor. Comput. Sci., 2000
Theor. Comput. Sci., 2000
Springer, ISBN: 978-1-85233-074-3, 2000
1999
1998
Economical Transformations of Phrase-Structure Grammars to Scattered Context Grammars.
Acta Cybern., 1998
1997
Four-nonterminal scattered context grammars characterize the family of recursively enumerable languages.
Int. J. Comput. Math., 1997
Six-Nonterminal multi-sequential grammars characterize the family of recursively enumerable languages.
Int. J. Comput. Math., 1997
Proceedings of the New Trends in Formal Languages, 1997
1996
Acta Informatica, 1996
1995
A trivial method of characterizing the family of recursively enumerable languages by scattered context grammars.
Bull. EATCS, 1995
1994
Grammars without context conditions.
Bull. EATCS, 1994
On Semi-Conditional Grammars with Productions Having either Forbidding or Permitting Conditions.
Acta Cybern., 1994
1992
1991
Global Context Conditional Grammars.
J. Inf. Process. Cybern., 1991
1990
1988
1987
1986