The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Alexander Meduna: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Alexander Meduna
    On the Number of Nonterminals in Matrix Grammars with Leftmost Derivations. [Citation Graph (0, 0)][DBLP]
    New Trends in Formal Languages, 1997, pp:27-38 [Conf]
  2. Alexander Meduna, Dusan Kolar
    Descriptional Complexity of Multi-Parallel Grammars with Respect to the Number of Nonterminals. [Citation Graph (0, 0)][DBLP]
    Grammars and Automata for String Processing, 2003, pp:91-98 [Conf]
  3. Alexander Meduna
    Coincidental extension of scattered context languages. [Citation Graph (0, 0)][DBLP]
    Acta Inf., 2003, v:39, n:5, pp:307-314 [Journal]
  4. Alexander Meduna
    Erratum: Coincidental extension of scattered context languages. [Citation Graph (0, 0)][DBLP]
    Acta Inf., 2003, v:39, n:9, pp:699- [Journal]
  5. Alexander Meduna
    Deep pushdown automata. [Citation Graph (0, 0)][DBLP]
    Acta Inf., 2006, v:42, n:8-9, pp:541-552 [Journal]
  6. Alexander Meduna
    Context Free Derivations on Word Monoids. [Citation Graph (0, 0)][DBLP]
    Acta Inf., 1989, v:27, n:8, pp:781-786 [Journal]
  7. Alexander Meduna
    Syntactic Complexity of Scattered Context Grammars [Citation Graph (0, 0)][DBLP]
    Acta Inf., 1995, v:32, n:3, pp:285-298 [Journal]
  8. Alexander Meduna
    Syntactic Complexity of Context-Free Grammars Over Word Monoids. [Citation Graph (0, 0)][DBLP]
    Acta Inf., 1996, v:33, n:5, pp:457-462 [Journal]
  9. Alexander Meduna
    Two-Way Metalinear PC Grammar Systems and Their Descriptional Complexity. [Citation Graph (0, 0)][DBLP]
    Acta Cybern., 2004, v:16, n:3, pp:385-397 [Journal]
  10. Alexander Meduna
    Evaluated grammars. [Citation Graph (0, 0)][DBLP]
    Acta Cybern., 1987, v:8, n:, pp:169-176 [Journal]
  11. Alexander Meduna
    Symbiotic EOL Systems. [Citation Graph (0, 0)][DBLP]
    Acta Cybern., 1992, v:10, n:3, pp:165-172 [Journal]
  12. Alexander Meduna
    Economical Transformations of Phrase-Structure Grammars to Scattered Context Grammars. [Citation Graph (0, 0)][DBLP]
    Acta Cybern., 1998, v:13, n:3, pp:225-242 [Journal]
  13. Alexander Meduna
    Descriptional Complexity of Multi-Continuous Grammars. [Citation Graph (0, 0)][DBLP]
    Acta Cybern., 1998, v:13, n:4, pp:375-384 [Journal]
  14. Alexander Meduna, A. Gopalaratnam
    On Semi-Conditional Grammars with Productions Having either Forbidding or Permitting Conditions. [Citation Graph (0, 0)][DBLP]
    Acta Cybern., 1994, v:11, n:4, pp:307-324 [Journal]
  15. Alexander Meduna, Gy. Horváth
    On state grammars. [Citation Graph (0, 0)][DBLP]
    Acta Cybern., 1988, v:8, n:, pp:237-245 [Journal]
  16. Alexander Meduna, Dusan Kolar
    Regulated Pushdown Automata. [Citation Graph (0, 0)][DBLP]
    Acta Cybern., 2000, v:14, n:4, pp:653-664 [Journal]
  17. Alexander Meduna, Martin Svec
    Reduction of Simple Semi-Conditional Grammars with Respect to the Number of Conditional Productions. [Citation Graph (0, 0)][DBLP]
    Acta Cybern., 2002, v:15, n:3, pp:353-360 [Journal]
  18. Alexander Meduna, Jirí Techet
    Generation of Sentences with Their Parses: the Case of Propagating Scattered Context Grammars. [Citation Graph (0, 0)][DBLP]
    Acta Cybern., 2005, v:17, n:1, pp:- [Journal]
  19. Alexander Meduna, Tomás Kopecek
    Simple-Semi-Conditional Versions of Matrix Grammars with a Reduced Regulating Mechanism. [Citation Graph (0, 0)][DBLP]
    Computers and Artificial Intelligence, 2004, v:23, n:3, pp:- [Journal]
  20. Erzsébet Csuhaj-Varjú, Alexander Meduna
    Grammars without context conditions. [Citation Graph (0, 0)][DBLP]
    Bulletin of the EATCS, 1994, v:53, n:, pp:199-212 [Journal]
  21. Alexander Meduna
    A trivial method of characterizing the family of recursively enumerable languages by scattered context grammars. [Citation Graph (0, 0)][DBLP]
    Bulletin of the EATCS, 1995, v:56, n:, pp:- [Journal]
  22. Alexander Meduna
    Global Context Conditional Grammars. [Citation Graph (0, 0)][DBLP]
    Elektronische Informationsverarbeitung und Kybernetik, 1991, v:27, n:3, pp:159-165 [Journal]
  23. Alexander Meduna
    Uniform Generation of Languages by Scattered Context Grammars. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 2001, v:45, n:3, pp:231-235 [Journal]
  24. Alexander Meduna, Duwan Koláq
    One-Turn Regulated Pushdown Automata and Their Reduction. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 2002, v:51, n:4, pp:399-405 [Journal]
  25. Alexander Meduna, Petr Vurm
    Multisequential Grammars with Homogeneous Selectors. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 2001, v:48, n:1, pp:55-60 [Journal]
  26. Alexander Meduna
    Simultaneously One-Turn Two-Pushdown Automata. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Math., 2003, v:80, n:6, pp:679-687 [Journal]
  27. Alexander Meduna, Martin Svec
    Descriptional Complexity of Generalized Forbidding Grammars. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Math., 2003, v:80, n:1, pp:11-17 [Journal]
  28. Zbynek Krivka, Alexander Meduna, Rudolf Schönecker
    Generation of Languages by Rewriting Systems that Resemble Automata. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 2006, v:17, n:5, pp:1223-1230 [Journal]
  29. Henning Fernau, Alexander Meduna
    A simultaneous reduction of several measures of descriptional complexity in scattered context grammars. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2003, v:86, n:5, pp:235-240 [Journal]
  30. Alexander Meduna, Dusan Kolar
    Homogeneous grammars with a reduced number of non-context-free productions. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2002, v:81, n:5, pp:253-257 [Journal]
  31. Alexander Meduna
    Descriptional Complexity of Scattered Rewriting and Multirewriting: An Overview. [Citation Graph (0, 0)][DBLP]
    Journal of Automata, Languages and Combinatorics, 2002, v:7, n:4, pp:571-577 [Journal]
  32. Henning Fernau, Alexander Meduna
    On the degree of scattered context-sensitivity. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:290, n:3, pp:2121-2124 [Journal]
  33. Alexander Meduna
    Terminating left-hand sides of scattered context productions M. Nivat. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2000, v:237, n:1-2, pp:423-427 [Journal]
  34. Alexander Meduna
    Generative power of three-nonterminal scattered context grammars. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2000, v:246, n:1-2, pp:279-284 [Journal]
  35. Alexander Meduna, Martin Svec
    Forbidding ET0L grammars. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:306, n:1-3, pp:449-469 [Journal]
  36. Alexander Meduna, Jirí Techet
    Maximal and Minimal Scattered Context Rewriting. [Citation Graph (0, 0)][DBLP]
    FCT, 2007, pp:412-423 [Conf]
  37. Tomás Masopust, Alexander Meduna
    Descriptional complexity of semi-conditional grammars. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2007, v:104, n:1, pp:29-31 [Journal]

  38. On Vertical Grammatical Restrictions that Produce an Infinite Language Hierarchy. [Citation Graph (, )][DBLP]


  39. Generalized #-Rewriting Systems of Finite Index. [Citation Graph (, )][DBLP]


  40. General Multigenerative Grammar Systems. [Citation Graph (, )][DBLP]


  41. Scattered context grammars that erase nonterminals in a generalized k -limited way. [Citation Graph (, )][DBLP]


  42. Two Power-Decreasing Derivation Restrictions in Generalized Scattered Context Grammars. [Citation Graph (, )][DBLP]


  43. Self-Regulating Finite Automata. [Citation Graph (, )][DBLP]


  44. On Pure Multi-Pushdown Automata that Perform Complete Pushdown Pops. [Citation Graph (, )][DBLP]


  45. Descriptional Complexity of Three-Nonterminal Scattered Context Grammars: An Improvement [Citation Graph (, )][DBLP]


Search in 0.030secs, Finished in 0.032secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002