default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAlexander Meduna
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[i1]Martin Havel, Zbynek Krivka, Alexander Meduna:
How to Demonstrate Metalinearness and Regularity by Tree-Restricted General Grammars. CoRR abs/2409.06972 (2024)- 2023
- [b4]Alexander Meduna, Tomás Kozár:
Automata - Theory, Trends, and Applications. WorldScientific 2023, ISBN 9789811278129, pp. 1-436 - [c24]Tomás Kozár, Zbynek Krivka
, Alexander Meduna:
Final Sentential Forms. NCMA 2023: 38-47 - 2022
- [j82]Radim Kocman, Zbynek Krivka, Alexander Meduna, Benedek Nagy:
A jumping $5'\rightarrow 3'$ Watson-Crick finite automata model. Acta Informatica 59(5): 557-584 (2022) - [j81]Alexander Meduna, Martin Havel:
On Elimination of Erasing Rules from E0S Grammars. Comput. Sci. J. Moldova 30(2): 135-147 (2022) - [j80]Jakub Martisko, Alexander Meduna, Zbynek Krivka:
CD Grammar Systems with Two Propagating Scattered Context Components Characterize the Family of Context Sensitive Languages. Int. J. Found. Comput. Sci. 33(3&4): 335-348 (2022) - [c23]Dominika Klobucníková, Zbynek Krivka, Alexander Meduna:
Conclusive Tree-Controlled Grammars. NCMA 2022: 112-125 - 2021
- [j79]Zbynek Krivka, Alexander Meduna:
Scattered Context Grammars with One Non-Context-Free Production are Computationally Complete. Fundam. Informaticae 179(4): 361-384 (2021) - 2020
- [j78]Radim Kocman, Zbynek Krivka, Alexander Meduna:
General CD Grammar Systems and Their Simplification. J. Autom. Lang. Comb. 25(1): 37-54 (2020)
2010 – 2019
- 2019
- [j77]Zbynek Krivka, Jirí Kucera, Alexander Meduna:
Jumping Pure Grammars. Comput. J. 62(1): 30-41 (2019) - [j76]Alexander Meduna, Radim Krcmár, Adam Kövári, Zuzana Benícková:
On Operations over Language Families. Comput. Sci. J. Moldova 27(3): 255-282 (2019) - 2018
- [j75]Radim Kocman, Zbynek Krivka, Alexander Meduna:
On double-jumping finite automata and their closure properties. RAIRO Theor. Informatics Appl. 52(2-3-4): 185-199 (2018) - [c22]Radim Kocman, Benedek Nagy, Zbynek Krivka, Alexander Meduna:
A jumping 5' → 3' Watson-Crick finite automata model. NCMA 2018: 117-132 - 2017
- [b3]Alexander Meduna, Ondrej Soukup:
Modern Language Models and Computation - Theory with Applications. Springer 2017, ISBN 978-3-319-63099-1, pp. 1-494 - [j74]Alexander Meduna, Ondrej Soukup:
Jumping Scattered Context Grammars. Fundam. Informaticae 152(1): 51-86 (2017) - [j73]Alexander Meduna, Ondrej Soukup, Erzsébet Csuhaj-Varjú:
On tree-restricted regular-controlled context-free grammars. Int. J. Comput. Math. Comput. Syst. Theory 2(4): 147-163 (2017) - [c21]Alexander Meduna, Jakub Martisko:
CD Grammar Systems with Two Propagating Scattered Context Components Characterize the Family of Context Sensitive Languages. AFL 2017: 170-179 - 2016
- [j72]Zbynek Krivka, Alexander Meduna, Petr Zemek:
Phrase-Structure Grammars: Normal Forms and Reduction. Comput. J. 59(8): 1180-1185 (2016) - [j71]Alexander Meduna, Ondrej Soukup:
Simple Matrix Grammars and Their Leftmost Variants. Int. J. Found. Comput. Sci. 27(3): 359-374 (2016) - [j70]Alexander Meduna, Ondrej Soukup:
Corrigendum: "Simple Matrix Grammars and Their Leftmost Variants [3]". Int. J. Found. Comput. Sci. 27(5): 651- (2016) - [c20]Radim Kocman, Zbynek Krivka, Alexander Meduna:
On double-jumping finite automata. NCMA 2016: 195-210 - 2015
- [j69]Zbynek Krivka, Alexander Meduna:
Jumping Grammars. Int. J. Found. Comput. Sci. 26(6): 709-732 (2015) - 2014
- [b2]Alexander Meduna, Petr Zemek:
Regulated Grammars and Automata. Springer 2014, ISBN 978-1-4939-0368-9, pp. 1-678 - [j68]Alexander Meduna, Petr Zemek:
Controlled finite automata. Acta Informatica 51(5): 327-337 (2014) - [j67]Alexander Meduna, Lukás Vrábel, Petr Zemek:
Solutions to four open problems concerning controlled pure grammar systems. Int. J. Comput. Math. 91(6): 1156-1169 (2014) - [j66]Alexander Meduna, Petr Zemek:
One-sided random context grammars with a limited number of right random context rules. Theor. Comput. Sci. 516: 127-132 (2014) - [c19]Alexander Meduna, Petr Zemek:
One-Sided Random Context Grammars: A Survey. Computing with New Resources 2014: 338-351 - [c18]Zbynek Krivka, Carlos Martín-Vide, Alexander Meduna, K. G. Subramanian:
A Variant of Pure Two-Dimensional Context-Free Grammars Generating Picture Languages. IWCIA 2014: 123-133 - 2013
- [j65]Alexander Meduna, Petr Zemek:
Left Random Context ET0L Grammars. Fundam. Informaticae 123(3): 289-304 (2013) - [j64]Alexander Meduna, Petr Zemek:
Generalized one-sided forbidding grammars. Int. J. Comput. Math. 90(2): 172-182 (2013) - [j63]Alexander Meduna, Petr Zemek:
On the generation of sentences with their parses by propagating regular-controlled grammars. Theor. Comput. Sci. 477: 67-75 (2013) - 2012
- [j62]Alexander Meduna, Petr Zemek:
Nonterminal complexity of one-sided random context grammars. Acta Informatica 49(2): 55-68 (2012) - [j61]Alexander Meduna, Petr Zemek:
One-sided forbidding grammars and selective substitution grammars. Int. J. Comput. Math. 89(5): 586-596 (2012) - [j60]Alexander Meduna, Petr Zemek:
Jumping Finite Automata. Int. J. Found. Comput. Sci. 23(7): 1555-1578 (2012) - [j59]Alexander Meduna, Petr Zemek:
Controlled Pure Grammar Systems. J. Univers. Comput. Sci. 18(14): 2024-2040 (2012) - [j58]Jirí Koutný, Alexander Meduna:
Tree-controlled grammars with restrictions placed upon cuts and paths. Kybernetika 48(1): 165-175 (2012) - [c17]Alexander Meduna, Petr Zemek:
One-Sided Random Context Grammars with Leftmost Derivations. Languages Alive 2012: 160-173 - [c16]Alexander Meduna, Lukás Vrábel, Petr Zemek:
An Infinite Hierarchy of Language Families Resulting from Stateless Pushdown Automata with Limited Pushdown Alphabets. DCFS 2012: 236-243 - 2011
- [j57]Alexander Meduna, Petr Zemek:
One-sided random context grammars. Acta Informatica 48(3): 149-163 (2011) - [j56]Alexander Meduna, Petr Zemek:
Workspace theorems for regular-controlled grammars. Theor. Comput. Sci. 412(35): 4604-4612 (2011) - [c15]Martin Cermák, Alexander Meduna:
n-Accepting Restricted Pushdown Automata Systems. AFL 2011: 168-183 - [c14]Alexander Meduna, Lukás Vrábel, Petr Zemek:
On Nondeterminism in Programmed Grammars. AFL 2011: 315-327 - [c13]Lukás Durfina, Jakub Kroustek, Petr Zemek, Dusan Kolár, Tomás Hruska, Karel Masarík, Alexander Meduna:
Design of a Retargetable Decompiler for a Static Platform-Independent Malware Analysis. ISA 2011: 72-86 - 2010
- [j55]Roman Lukás, Alexander Meduna:
Multigenerative grammar systems and matrix grammars. Kybernetika 46(1): 68-82 (2010) - [j54]Filip Goldefus, Tomás Masopust, Alexander Meduna:
Left-forbidding cooperating distributed grammar systems. Theor. Comput. Sci. 411(40-42): 3661-3667 (2010)
2000 – 2009
- 2009
- [j53]Tomás Masopust, Alexander Meduna:
On Pure Multi-Pushdown Automata that Perform Complete Pushdown Pops. Acta Cybern. 19(2): 537-552 (2009) - [j52]Tomás Masopust, Alexander Meduna:
On context-free rewriting with a simple restriction and its computational completeness. RAIRO Theor. Informatics Appl. 43(2): 365-378 (2009) - [j51]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) - [c12]Tomás Masopust, Alexander Meduna:
Descriptional Complexity of Three-Nonterminal Scattered Context Grammars: An Improvement. DCFS 2009: 183-192 - 2008
- [j50]Alexander Meduna, Jirí Techet:
Scattered context grammars that erase nonterminals in a generalized k -limited way. Acta Informatica 45(7-8): 593-608 (2008) - [j49]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) - [j48]Tomás Masopust, Alexander Meduna:
On Descriptional Complexity of Partially Parallel Grammars. Fundam. Informaticae 87(3-4): 407-415 (2008) - [c11]Tomás Masopust, Alexander Meduna:
On Pure Multi-Pushdown Automata that Perform Complete-Pushdown Pops. AFL 2008: 325-336 - 2007
- [j47]Alexander Meduna, Tomás Masopust:
Self-Regulating Finite Automata. Acta Cybern. 18(1): 135-153 (2007) - [j46]Alexander Meduna, Martin Svec, Tomás Kopecek:
Obituary for David John Evans (1928-2005). Int. J. Comput. Math. 84(11): 1551-1553 (2007) - [j45]Tomás Masopust, Alexander Meduna:
Descriptional complexity of semi-conditional grammars. Inf. Process. Lett. 104(1): 29-31 (2007) - [j44]Petr Blatný, Radek Bidlo, Alexander Meduna:
Automata with two-sided pushdowns defined over free groups generated by reduced alphabets. Kybernetika 43(3): 265-278 (2007) - [j43]Alexander Meduna, Jirí Techet:
Canonical scattered context generators of sentences with their parses. Theor. Comput. Sci. 389(1-2): 73-81 (2007) - [c10]Tomás Masopust, Alexander Meduna:
Descriptional Complexity of Generalized Forbidding Grammars. DCFS 2007: 170-177 - [c9]Alexander Meduna, Jirí Techet:
Reduction of Scattered Context Generators of Sentences Preceded by Their Leftmost Parses. DCFS 2007: 178-185 - [c8]Alexander Meduna, Jirí Techet:
Maximal and Minimal Scattered Context Rewriting. FCT 2007: 412-423 - [c7]Radek Bidlo, Petr Blatný, Alexander Meduna:
On Vertical Grammatical Restrictions that Produce an Infinite Language Hierarchy. Workshop on Formal Models 2007 - [c6]Zbynek Krivka, Alexander Meduna:
Generalized #-Rewriting Systems of Finite Index. Workshop on Formal Models 2007 - [c5]Roman Lukás, Alexander Meduna:
General Multigenerative Grammar Systems. Workshop on Formal Models 2007 - [c4]Tomás Masopust, Alexander Meduna:
Descriptional Complexity of Grammars Regulated by Context Conditions. LATA 2007: 403-412 - [e1]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 Workshop Proceedings 255, CEUR-WS.org 2007 [contents] - 2006
- [j42]Alexander Meduna:
Deep pushdown automata. Acta Informatica 42(8-9): 541-552 (2006) - [j41]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
- [j40]Alexander Meduna, Jirí Techet:
Generation of Sentences with Their Parses: the Case of Propagating Scattered Context Grammars. Acta Cybern. 17(1): 11-20 (2005) - [j39]Alexander Meduna, Lubos Lorenc:
Self-reproducing pushdown transducers. Kybernetika 41(4): 531-537 (2005) - 2004
- [j38]Alexander Meduna:
Two-Way Metalinear PC Grammar Systems and Their Descriptional Complexity. Acta Cybern. 16(3): 385-397 (2004) - [j37]Alexander Meduna, Tomás Kopecek:
Simple-Semi-Conditional Versions of Matrix Grammars with a Reduced Regulating Mechanism. Comput. Artif. Intell. 23(3): 287-302 (2004) - 2003
- [j36]Alexander Meduna:
Coincidental extension of scattered context languages. Acta Informatica 39(5): 307-314 (2003) - [j35]Alexander Meduna:
Erratum: Coincidental extension of scattered context languages. Acta Informatica 39(9): 699 (2003) - [j34]Alexander Meduna, Martin Svec:
Descriptional Complexity of Generalized Forbidding Grammars. Int. J. Comput. Math. 80(1): 11-17 (2003) - [j33]Alexander Meduna:
Simultaneously One-Turn Two-Pushdown Automata. Int. J. Comput. Math. 80(6): 679-687 (2003) - [j32]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) - [j31]Henning Fernau, Alexander Meduna:
On the degree of scattered context-sensitivity. Theor. Comput. Sci. 290(3): 2121-2124 (2003) - [j30]Alexander Meduna, Martin Svec:
Forbidding ET0L grammars. Theor. Comput. Sci. 306(1-3): 449-469 (2003) - [c3]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 - 2002
- [j29]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) - [j28]Alexander Meduna, Duwan Koláq:
One-Turn Regulated Pushdown Automata and Their Reduction. Fundam. Informaticae 51(4): 399-405 (2002) - [j27]Alexander Meduna, Dusan Kolár:
Homogeneous grammars with a reduced number of non-context-free productions. Inf. Process. Lett. 81(5): 253-257 (2002) - [j26]Alexander Meduna:
Descriptional Complexity of Scattered Rewriting and Multirewriting: An Overview. J. Autom. Lang. Comb. 7(4): 571-577 (2002) - 2001
- [j25]Alexander Meduna:
Uniform Generation of Languages by Scattered Context Grammars. Fundam. Informaticae 45(3): 231-235 (2001) - [j24]Alexander Meduna, Petr Vurm:
Multisequential Grammars with Homogeneous Selectors. Fundam. Informaticae 48(1): 55-60 (2001) - [c2]Alexander Meduna:
Descriptional Complexity of Partially Parallel Grammars. DCFS 2001: 15-21 - 2000
- [b1]Alexander Meduna:
Automata and languages - theory and applications. Springer 2000, ISBN 978-1-85233-074-3, pp. I-XV, 1-916 - [j23]Alexander Meduna, Dusan Kolár:
Regulated Pushdown Automata. Acta Cybern. 14(4): 653-664 (2000) - [j22]Alexander Meduna:
Terminating left-hand sides of scattered context productions M. Nivat. Theor. Comput. Sci. 237(1-2): 423-427 (2000) - [j21]Alexander Meduna:
Generative power of three-nonterminal scattered context grammars. Theor. Comput. Sci. 246(1-2): 279-284 (2000)
1990 – 1999
- 1999
- [j20]Alexander Meduna:
Prefix pushdown automata and their simplification. Int. J. Comput. Math. 71(1): 1-20 (1999) - [j19]Alexander Meduna:
Middle quotients of linear languages. Int. J. Comput. Math. 71(3): 319-335 (1999) - 1998
- [j18]Alexander Meduna:
Economical Transformations of Phrase-Structure Grammars to Scattered Context Grammars. Acta Cybern. 13(3): 225-242 (1998) - [j17]Alexander Meduna:
Descriptional Complexity of Multi-Continuous Grammars. Acta Cybern. 13(4): 375-384 (1998) - [j16]Alexander Meduna:
Uniform rewriting based on permutations. Int. J. Comput. Math. 69(1-2): 57-74 (1998) - 1997
- [j15]Alexander Meduna:
Four-nonterminal scattered context grammars characterize the family of recursively enumerable languages. Int. J. Comput. Math. 63(1-2): 67-83 (1997) - [j14]Alexander Meduna:
Six-Nonterminal multi-sequential grammars characterize the family of recursively enumerable languages. Int. J. Comput. Math. 65(3-4): 179-189 (1997) - [c1]Alexander Meduna:
On the Number of Nonterminals in Matrix Grammars with Leftmost Derivations. New Trends in Formal Languages 1997: 27-38 - 1996
- [j13]Alexander Meduna:
Syntactic Complexity of Context-Free Grammars Over Word Monoids. Acta Informatica 33(5): 457-462 (1996) - 1995
- [j12]Alexander Meduna:
Syntactic Complexity of Scattered Context Grammars. Acta Informatica 32(3): 285-298 (1995) - [j11]Alexander Meduna:
A trivial method of characterizing the family of recursively enumerable languages by scattered context grammars. Bull. EATCS 56 (1995) - 1994
- [j10]Alexander Meduna, A. Gopalaratnam:
On Semi-Conditional Grammars with Productions Having either Forbidding or Permitting Conditions. Acta Cybern. 11(4): 307-323 (1994) - [j9]Erzsébet Csuhaj-Varjú, Alexander Meduna:
Grammars without context conditions. Bull. EATCS 53: 199-212 (1994) - [j8]Alexander Meduna, Cynthia J. Crooks, Milan Sárek:
Syntactic complexity of regulated rewriting. Kybernetika 30(2): 177-186 (1994) - 1992
- [j7]Alexander Meduna:
Symbiotic EOL Systems. Acta Cybern. 10(3): 165-172 (1992) - 1991
- [j6]Alexander Meduna:
Global Context Conditional Grammars. J. Inf. Process. Cybern. 27(3): 159-165 (1991) - 1990
- [j5]Alexander Meduna:
Context Free Derivations on Word Monoids. Acta Informatica 27(8): 781-786 (1990) - [j4]Alexander Meduna:
Generalized forbidding grammars. Int. J. Comput. Math. 36(1-2): 31-38 (1990)
1980 – 1989
- 1988
- [j3]Alexander Meduna, Gy. Horváth:
On state grammars. Acta Cybern. 8(3): 237-245 (1988) - 1987
- [j2]Alexander Meduna:
Evaluated grammars. Acta Cybern. 8(2): 169-176 (1987) - 1986
- [j1]Alexander Meduna:
A note on exponential density of ETOL languages. Kybernetika 22(6): 514-518 (1986)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-15 00:27 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
