 | 2012 |
|---|
| 67 |       | Alexander Meduna,
Petr Zemek:
Nonterminal complexity of one-sided random context grammars.
Acta Inf. 49(2): 55-68 (2012) |
| 66 | | Alexander Meduna,
Petr Zemek:
One-sided forbidding grammars and selective substitution grammars.
Int. J. Comput. Math. 89(5): 586-596 (2012) |
| 2011 |
|---|
| 65 |  | Martin Cermák,
Alexander Meduna:
n-Accepting Restricted Pushdown Automata Systems.
AFL 2011: 168-183 |
| 64 | | Alexander Meduna,
Lukás Vrábel,
Petr Zemek:
On Nondeterminism in Programmed Grammars.
AFL 2011: 315-327 |
| 63 | | Lukás Durfina,
Jakub Kroustek,
Petr Zemek,
Dusan Kolár,
Tomas Hruska,
Karel Masarik,
Alexander Meduna:
Design of a Retargetable Decompiler for a Static Platform-Independent Malware Analysis.
ISA 2011: 72-86 |
| 62 | | Alexander Meduna,
Petr Zemek:
One-sided random context grammars.
Acta Inf. 48(3): 149-163 (2011) |
| 61 | | Alexander Meduna,
Petr Zemek:
Workspace theorems for regular-controlled grammars.
Theor. Comput. Sci. 412(35): 4604-4612 (2011) |
| 2010 |
|---|
| 60 | | Filip Goldefus,
Tomás Masopust,
Alexander Meduna:
Left-forbidding cooperating distributed grammar systems.
Theor. Comput. Sci. 411(40-42): 3661-3667 (2010) |
| 2009 |
|---|
| 59 | | Tomás Masopust,
Alexander Meduna:
Descriptional Complexity of Three-Nonterminal Scattered Context Grammars: An Improvement
DCFS 2009: 183-192 |
| 58 | | Tomás Masopust,
Alexander Meduna:
On Pure Multi-Pushdown Automata that Perform Complete Pushdown Pops.
Acta Cybern. 19(2): 537-552 (2009) |
| 57 | | Tomás Masopust,
Alexander Meduna:
On context-free rewriting with a simple restriction and its computational completeness.
ITA 43(2): 365-378 (2009) |
| 56 | | Alexander Meduna,
Jirí Techet:
An infinite hierarchy of language families generated by scattered context grammars with n-limited derivations.
Theor. Comput. Sci. 410(21-23): 1961-1969 (2009) |
| 2008 |
|---|
| 55 | | Tomás Masopust,
Alexander Meduna:
On Pure Multi-Pushdown Automata that Perform Complete-Pushdown Pops.
AFL 2008: 325-336 |
| 54 | | Tomás Masopust,
Alexander Meduna,
Jirí Simácek:
Two Power-Decreasing Derivation Restrictions in Generalized Scattered Context Grammars.
Acta Cybern. 18(4): 783-793 (2008) |
| 53 | | Alexander Meduna,
Jirí Techet:
Scattered context grammars that erase nonterminals in a generalized k -limited way.
Acta Inf. 45(7-8): 593-608 (2008) |
| 52 | | Tomás Masopust,
Alexander Meduna:
On Descriptional Complexity of Partially Parallel Grammars.
Fundam. Inform. 87(3-4): 407-415 (2008) |
| 2007 |
|---|
| 51 | | Alica Kelemenová,
Dusan Kolár,
Alexander Meduna:
Proceedings of the 2nd International Workshop on Formal Models WFM'07, Hradec nad Moravicí, Czech Republic, April 23-25, 2007
CEUR-WS.org 2007 |
| 50 | | Tomás Masopust,
Alexander Meduna:
Descriptional Complexity of Generalized Forbidding Grammars.
DCFS 2007: 170-177 |
| 49 | | Alexander Meduna,
Jirí Techet:
Reduction of Scattered Context Generators of Sentences Preceded by Their Leftmost Parses.
DCFS 2007: 178-185 |
| 48 | | Alexander Meduna,
Jirí Techet:
Maximal and Minimal Scattered Context Rewriting.
FCT 2007: 412-423 |
| 47 | | Tomás Masopust,
Alexander Meduna:
Descriptional Complexity of Grammars Regulated by Context Conditions.
LATA 2007: 403-412 |
| 46 | | Roman Lukás,
Alexander Meduna:
General Multigenerative Grammar Systems.
Workshop on Formal Models 2007 |
| 45 | | Zbynek Krivka,
Alexander Meduna:
Generalized #-Rewriting Systems of Finite Index.
Workshop on Formal Models 2007 |
| 44 | | Radek Bidlo,
Petr Blatný,
Alexander Meduna:
On Vertical Grammatical Restrictions that Produce an Infinite Language Hierarchy.
Workshop on Formal Models 2007 |
| 43 | | Alexander Meduna,
Tomás Masopust:
Self-Regulating Finite Automata.
Acta Cybern. 18(1): 135-153 (2007) |
| 42 | | Tomás Masopust,
Alexander Meduna:
Descriptional complexity of semi-conditional grammars.
Inf. Process. Lett. 104(1): 29-31 (2007) |
| 41 | | Alexander Meduna,
Martin Svec,
Tomás Kopecek:
Obituary for David John Evans (1928-2005).
Int. J. Comput. Math. 84(11): 1551-1553 (2007) |
| 40 | | Alexander Meduna,
Jirí Techet:
Canonical scattered context generators of sentences with their parses.
Theor. Comput. Sci. 389(1-2): 73-81 (2007) |
| 2006 |
|---|
| 39 | | Alexander Meduna:
Deep pushdown automata.
Acta Inf. 42(8-9): 541-552 (2006) |
| 38 | | Zbynek Krivka,
Alexander Meduna,
Rudolf Schönecker:
Generation of Languages by Rewriting Systems that Resemble Automata.
Int. J. Found. Comput. Sci. 17(5): 1223-1230 (2006) |
| 2005 |
|---|
| 37 | | Alexander Meduna,
Jirí Techet:
Generation of Sentences with Their Parses: the Case of Propagating Scattered Context Grammars.
Acta Cybern. 17(1): (2005) |
| 2004 |
|---|
| 36 | | Alexander Meduna:
Two-Way Metalinear PC Grammar Systems and Their Descriptional Complexity.
Acta Cybern. 16(3): 385-397 (2004) |
| 35 | | Alexander Meduna,
Tomás Kopecek:
Simple-Semi-Conditional Versions of Matrix Grammars with a Reduced Regulating Mechanism.
Computers and Artificial Intelligence 23(3): 287-302 (2004) |
| 2003 |
|---|
| 34 | | Alexander Meduna,
Dusan Kolár:
Descriptional Complexity of Multi-Parallel Grammars with Respect to the Number of Nonterminals.
Grammars and Automata for String Processing 2003: 91-98 |
| 33 | | Alexander Meduna:
Coincidental extension of scattered context languages.
Acta Inf. 39(5): 307-314 (2003) |
| 32 | | Alexander Meduna:
Erratum: Coincidental extension of scattered context languages.
Acta Inf. 39(9): 699 (2003) |
| 31 | | Henning Fernau,
Alexander Meduna:
A simultaneous reduction of several measures of descriptional complexity in scattered context grammars.
Inf. Process. Lett. 86(5): 235-240 (2003) |
| 30 | | Alexander Meduna,
Martin Svec:
Descriptional Complexity of Generalized Forbidding Grammars.
Int. J. Comput. Math. 80(1): 11-17 (2003) |
| 29 | | Alexander Meduna:
Simultaneously One-Turn Two-Pushdown Automata.
Int. J. Comput. Math. 80(6): 679-687 (2003) |
| 28 | | Henning Fernau,
Alexander Meduna:
On the degree of scattered context-sensitivity.
Theor. Comput. Sci. 290(3): 2121-2124 (2003) |
| 27 | | Alexander Meduna,
Martin Svec:
Forbidding ET0L grammars.
Theor. Comput. Sci. 306(1-3): 449-469 (2003) |
| 2002 |
|---|
| 26 | | Alexander Meduna,
Martin Svec:
Reduction of Simple Semi-Conditional Grammars with Respect to the Number of Conditional Productions.
Acta Cybern. 15(3): 353-360 (2002) |
| 25 | | Alexander Meduna,
Duwan Koláq:
One-Turn Regulated Pushdown Automata and Their Reduction.
Fundam. Inform. 51(4): 399-405 (2002) |
| 24 | | Alexander Meduna,
Dusan Kolár:
Homogeneous grammars with a reduced number of non-context-free productions.
Inf. Process. Lett. 81(5): 253-257 (2002) |
| 23 | | Alexander Meduna:
Descriptional Complexity of Scattered Rewriting and Multirewriting: An Overview.
Journal of Automata, Languages and Combinatorics 7(4): 571-577 (2002) |
| 2001 |
|---|
| 22 | | Alexander Meduna:
Descriptional Complexity of Partially Parallel Grammars.
DCFS 2001: 15-21 |
| 21 | | Alexander Meduna:
Uniform Generation of Languages by Scattered Context Grammars.
Fundam. Inform. 45(3): 231-235 (2001) |
| 20 | | Alexander Meduna,
Petr Vurm:
Multisequential Grammars with Homogeneous Selectors.
Fundam. Inform. 48(1): 55-60 (2001) |
| 2000 |
|---|
| 19 | | Alexander Meduna:
Automata and languages - theory and applications.
Springer 2000: I-XV, 1-916 |
| 18 | | Alexander Meduna,
Dusan Kolár:
Regulated Pushdown Automata.
Acta Cybern. 14(4): 653-664 (2000) |
| 17 | | Alexander Meduna:
Terminating left-hand sides of scattered context productions M. Nivat.
Theor. Comput. Sci. 237(1-2): 423-427 (2000) |
| 16 | | Alexander Meduna:
Generative power of three-nonterminal scattered context grammars.
Theor. Comput. Sci. 246(1-2): 279-284 (2000) |
| 1999 |
|---|
| 15 | | Alexander Meduna:
Prefix pushdown automata and their simplification.
Int. J. Comput. Math. 71(1): 1-20 (1999) |
| 14 | | Alexander Meduna:
Middle quotients of linear languages.
Int. J. Comput. Math. 71(3): 319-335 (1999) |
| 1998 |
|---|
| 13 | | Alexander Meduna:
Economical Transformations of Phrase-Structure Grammars to Scattered Context Grammars.
Acta Cybern. 13(3): 225-242 (1998) |
| 12 | | Alexander Meduna:
Descriptional Complexity of Multi-Continuous Grammars.
Acta Cybern. 13(4): 375-384 (1998) |
| 1997 |
|---|
| 11 | | Alexander Meduna:
On the Number of Nonterminals in Matrix Grammars with Leftmost Derivations.
New Trends in Formal Languages 1997: 27-38 |
| 1996 |
|---|
| 10 | | Alexander Meduna:
Syntactic Complexity of Context-Free Grammars Over Word Monoids.
Acta Inf. 33(5): 457-462 (1996) |
| 1995 |
|---|
| 9 | | Alexander Meduna:
Syntactic Complexity of Scattered Context Grammars.
Acta Inf. 32(3): 285-298 (1995) |
| 8 | | Alexander Meduna:
A trivial method of characterizing the family of recursively enumerable languages by scattered context grammars.
Bulletin of the EATCS 56: (1995) |
| 1994 |
|---|
| 7 | | Alexander Meduna,
A. Gopalaratnam:
On Semi-Conditional Grammars with Productions Having either Forbidding or Permitting Conditions.
Acta Cybern. 11(4): 307-324 (1994) |
| 6 | | Erzsébet Csuhaj-Varjú,
Alexander Meduna:
Grammars without context conditions.
Bulletin of the EATCS 53: 199-212 (1994) |
| 1992 |
|---|
| 5 | | Alexander Meduna:
Symbiotic EOL Systems.
Acta Cybern. 10(3): 165-172 (1992) |
| 1991 |
|---|
| 4 | | Alexander Meduna:
Global Context Conditional Grammars.
Elektronische Informationsverarbeitung und Kybernetik 27(3): 159-165 (1991) |
| 1989 |
|---|
| 3 | | Alexander Meduna:
Context Free Derivations on Word Monoids.
Acta Inf. 27(8): 781-786 (1989) |
| 1988 |
|---|
| 2 | | Alexander Meduna,
Gy. Horváth:
On state grammars.
Acta Cybern. 8: 237-245 (1988) |
| 1987 |
|---|
| 1 | | Alexander Meduna:
Evaluated grammars.
Acta Cybern. 8: 169-176 (1987) |
Data released under the ODC-BY 1.0 license — See also our legal information page