Alexander Meduna

According to our database1, Alexander Meduna
  • authored at least 91 papers between 1986 and 2017.
  • has a "Dijkstra number"2 of five.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2017
Jumping Scattered Context Grammars.
Fundam. Inform., 2017

2016
Corrigendum: "Simple Matrix Grammars and Their Leftmost Variants [3]".
Int. J. Found. Comput. Sci., 2016

Simple Matrix Grammars and Their Leftmost Variants.
Int. J. Found. Comput. Sci., 2016

Phrase-Structure Grammars: Normal Forms and Reduction.
Comput. J., 2016

On double-jumping finite automata.
Proceedings of the Eighth Workshop on Non-Classical Models of Automata and Applications, 2016

2015
Jumping Grammars.
Int. J. Found. Comput. Sci., 2015

2014
One-sided random context grammars with a limited number of right random context rules.
Theor. Comput. Sci., 2014

Solutions to four open problems concerning controlled pure grammar systems.
Int. J. Comput. Math., 2014

Controlled finite automata.
Acta Inf., 2014

A Variant of Pure Two-Dimensional Context-Free Grammars Generating Picture Languages.
Proceedings of the Combinatorial Image Analysis - 16th International Workshop, 2014

One-Sided Random Context Grammars: A Survey.
Proceedings of the Computing with New Resources, 2014

Regulated Grammars and Automata
Springer, ISBN: 978-1-4939-0369-6, 2014

2013
On the generation of sentences with their parses by propagating regular-controlled grammars.
Theor. Comput. Sci., 2013

Generalized one-sided forbidding grammars.
Int. J. Comput. Math., 2013

Left Random Context ET0L Grammars.
Fundam. Inform., 2013

2012
Tree-controlled grammars with restrictions placed upon cuts and paths.
Kybernetika, 2012

Controlled Pure Grammar Systems.
J. UCS, 2012

Jumping Finite Automata.
Int. J. Found. Comput. Sci., 2012

One-sided forbidding grammars and selective substitution grammars.
Int. J. Comput. Math., 2012

Nonterminal complexity of one-sided random context grammars.
Acta Inf., 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

One-Sided Random Context Grammars with Leftmost Derivations.
Proceedings of the Languages Alive, 2012

2011
Workspace theorems for regular-controlled grammars.
Theor. Comput. Sci., 2011

One-sided random context grammars.
Acta Inf., 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
Left-forbidding cooperating distributed grammar systems.
Theor. Comput. Sci., 2010

Multigenerative grammar systems and matrix grammars.
Kybernetika, 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.
ITA, 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

On Pure Multi-Pushdown Automata that Perform Complete Pushdown Pops.
Acta Cybern., 2009

2008
On Descriptional Complexity of Partially Parallel Grammars.
Fundam. Inform., 2008

Two Power-Decreasing Derivation Restrictions in Generalized Scattered Context Grammars.
Acta Cybern., 2008

Scattered context grammars that erase nonterminals in a generalized k -limited way.
Acta Inf., 2008

On Pure Multi-Pushdown Automata that Perform Complete-Pushdown Pops.
Proceedings of the Automata and Formal Languages, 12th International Conference, 2008

2007
Canonical scattered context generators of sentences with their parses.
Theor. Comput. Sci., 2007

Automata with two-sided pushdowns defined over free groups generated by reduced alphabets.
Kybernetika, 2007

Descriptional complexity of semi-conditional grammars.
Inf. Process. Lett., 2007

Obituary for David John Evans (1928-2005).
Int. J. Comput. Math., 2007

Self-Regulating Finite Automata.
Acta Cybern., 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

General Multigenerative Grammar Systems.
Proceedings of the 2nd International Workshop on Formal Models WFM'07, 2007

Generalized #-Rewriting Systems of Finite Index.
Proceedings of the 2nd International Workshop on Formal Models WFM'07, 2007

On Vertical Grammatical Restrictions that Produce an Infinite Language Hierarchy.
Proceedings of the 2nd International Workshop on Formal Models WFM'07, 2007

Maximal and Minimal Scattered Context Rewriting.
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
Generation of Languages by Rewriting Systems that Resemble Automata.
Int. J. Found. Comput. Sci., 2006

Deep pushdown automata.
Acta Inf., 2006

2005
Self-reproducing pushdown transducers.
Kybernetika, 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.
Computers and Artificial Intelligence, 2004

Two-Way Metalinear PC Grammar Systems and Their Descriptional Complexity.
Acta Cybern., 2004

2003
Forbidding ET0L grammars.
Theor. Comput. Sci., 2003

On the degree of scattered context-sensitivity.
Theor. Comput. Sci., 2003

A simultaneous reduction of several measures of descriptional complexity in scattered context grammars.
Inf. Process. Lett., 2003

Descriptional Complexity of Generalized Forbidding Grammars.
Int. J. Comput. Math., 2003

Simultaneously One-Turn Two-Pushdown Automata.
Int. J. Comput. Math., 2003

Erratum: Coincidental extension of scattered context languages.
Acta Inf., 2003

Coincidental extension of scattered context languages.
Acta Inf., 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
Descriptional Complexity of Scattered Rewriting and Multirewriting: An Overview.
Journal of Automata, Languages and Combinatorics, 2002

Homogeneous grammars with a reduced number of non-context-free productions.
Inf. Process. Lett., 2002

One-Turn Regulated Pushdown Automata and Their Reduction.
Fundam. Inform., 2002

Reduction of Simple Semi-Conditional Grammars with Respect to the Number of Conditional Productions.
Acta Cybern., 2002

2001
Multisequential Grammars with Homogeneous Selectors.
Fundam. Inform., 2001

Uniform Generation of Languages by Scattered Context Grammars.
Fundam. Inform., 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
Generative power of three-nonterminal scattered context grammars.
Theor. Comput. Sci., 2000

Terminating left-hand sides of scattered context productions M. Nivat.
Theor. Comput. Sci., 2000

Regulated Pushdown Automata.
Acta Cybern., 2000

Automata and languages - theory and applications.
Springer, ISBN: 978-1-85233-074-3, 2000

1999
Middle quotients of linear languages.
Int. J. Comput. Math., 1999

Prefix pushdown automata and their simplification.
Int. J. Comput. Math., 1999

1998
Descriptional Complexity of Multi-Continuous Grammars.
Acta Cybern., 1998

Economical Transformations of Phrase-Structure Grammars to Scattered Context Grammars.
Acta Cybern., 1998

1997
On the Number of Nonterminals in Matrix Grammars with Leftmost Derivations.
Proceedings of the New Trends in Formal Languages, 1997

1996
Syntactic Complexity of Context-Free Grammars Over Word Monoids.
Acta Inf., 1996

1995
A trivial method of characterizing the family of recursively enumerable languages by scattered context grammars.
Bulletin of the EATCS, 1995

Syntactic Complexity of Scattered Context Grammars.
Acta Inf., 1995

1994
Syntactic complexity of regulated rewriting.
Kybernetika, 1994

Grammars without context conditions.
Bulletin of the EATCS, 1994

On Semi-Conditional Grammars with Productions Having either Forbidding or Permitting Conditions.
Acta Cybern., 1994

1992
Symbiotic EOL Systems.
Acta Cybern., 1992

1991
Global Context Conditional Grammars.
Elektronische Informationsverarbeitung und Kybernetik, 1991

1990
Context Free Derivations on Word Monoids.
Acta Inf., 1990

1988
On state grammars.
Acta Cybern., 1988

1987
Evaluated grammars.
Acta Cybern., 1987

1986
A note on exponential density of ETOL languages.
Kybernetika, 1986


  Loading...