RNDr. Tomáš Masopust, Ph.D.

2011Křivka Zbyněk, Masopust Tomáš: Cooperating Distributed Grammar Systems with Random Context Grammars as Components, In: Acta Cybernetica, roč. 20, č. 2, 2011, US, s. 269-283, ISSN 0324-721X
 Meduna Alexander, Čermák Martin, Masopust Tomáš: Some Power-Decreasing Derivation Restrictions in Grammar Systems, In: Schedae Informaticae, roč. 2010, č. 19, 2011, Krakov, PL, s. 23-34, ISSN 0860-0295
2010Goldefus Filip, Masopust Tomáš, Meduna Alexander: Left-Forbidding Cooperating Distributed Grammar Systems, In: Theoretical Computer Science, roč. 40, č. 411, 2010, Paris, FR, s. 3661-3667, ISSN 0304-3975
2009Csuhaj-Varjú Erzsébet, Masopust Tomáš, Vaszil György: Cooperating Distributed Grammar Systems with Permitting Grammars as Components, In: Romanian Journal of Information Science and Technology (ROMJIST), roč. 12, č. 2, 2009, Bukurest, RO, s. 175-189, ISSN 1453-8245
 Křivka Zbyněk, Masopust Tomáš: A Note on the Cooperation in Rewriting Systems with Context-Dependency Checking, In: 11th Italian Conference on Theoretical Computer Science, Cremona, IT, 2009, s. 129-135
 Masopust Tomáš, Meduna Alexander: Descriptional Complexity of Three-Nonterminal Scattered Context Grammars: An Improvement, In: Proceedings of 11th International Workshop on Descriptional Complexity of Formal Systems, Magdeburg, DE, uni-magdeburg, 2009, s. 235-245, ISBN 978-3-940961-31-0
 Masopust Tomáš, Meduna Alexander: On context-free rewriting with a simple restriction and its computational completeness, In: RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, roč. 43, č. 2, 2009, Les Ulis, FR, s. 365-378, ISSN 0988-3754
 Masopust Tomáš, Meduna Alexander: On Pure Multi-Pushdown Automata that Perform Complete Pushdown Pops, In: Acta Cybernetica, roč. 19, č. 2, 2009, US, s. 537-552, ISSN 0324-721X
 Masopust Tomáš: A Note on the Generative Power of Some Simple Variants of Context-Free Grammars Regulated by Context Conditions, In: LATA 2009 proceedings, Springer-Verlag Berlin Heidelberg, ES, Springer, 2009, s. 554-565, ISBN 978-3-642-00981-5, ISSN 0302-9743
 Masopust Tomáš: Answers to Questions Formulated in the Paper "On States Observability in Deterministic Finite Automata", 2009, s. 6
 Masopust Tomáš: On the Descriptional Complexity of Scattered Context Grammars, In: Theoretical Computer Science, roč. 410, č. 1, 2009, Paris, FR, s. 108-112, ISSN 0304-3975
 Masopust Tomáš: On the Terminating Derivation Mode in Cooperating Distributed Grammar Systems with Forbidding Components, In: International Journal of Foundations of Computer Science, roč. 20, č. 2, 2009, SG, s. 331-340, ISSN 0129-0541
 Masopust Tomáš: Regulated Nondeterminism in PDAs: The Non-Regular Case, In: Proceedings of Workshop on Non-Classical Models of Automata and Applications (NCMA), Wroclaw, PL, ocg, 2009, s. 181-194, ISBN 978-3-85403-256-4
2008Masopust Tomáš, Meduna Alexander, Šimáček Jiří: Two Power-Decreasing Derivation Restrictions in Generalized Scattered Context Grammars, In: Acta Cybernetica, roč. 18, č. 4, 2008, US, s. 783-793, ISSN 0324-721X
 Masopust Tomáš, Meduna Alexander: On Descriptional Complexity of Partially Parallel Grammars, In: Fundamenta Informaticae, roč. 87, č. 3, 2008, Amsterdam, NL, s. 407-415, ISSN 0169-2968
 Masopust Tomáš, Meduna Alexander: On Pure Multi-Pushdown Automata that Perform Complete-Pushdown Pops, In: Automata and Formal Languages. The 12th International Conference, AFL 2008, Balatonfured, Hungary, May 27-30, 2008, Proceedings, Balatonfured, HU, MTA SZTAKI, 2008, s. 325-336, ISBN 978-963-311-367-7
 Masopust Tomáš, Techet Jiří: Leftmost Derivations of Propagating Scattered Context Grammars: A New Proof, In: Discrete Mathematics and Theoretical Computer Science, roč. 10, č. 2, 2008, Nancy, FR, s. 39-46, ISSN 1365-8050
 Masopust Tomáš: Descriptional Complexity of Multi-Parallel Grammars, In: Information Processing Letters, roč. 108, č. 2, 2008, Amsterdam, NL, s. 68-70, ISSN 0020-0190
2007Masopust Tomáš, Meduna Alexander: Descriptional Complexity of Generalized Forbidding Grammars, In: Proceedings of 9th International Workshop on Descriptional Complexity of Formal Systems, High Tatras, Slovakia, SK, UPJS, 2007, s. 170-177, ISBN 978-80-7097-688-3
 Masopust Tomáš, Meduna Alexander: Descriptional Complexity of Grammars Regulated by Context Conditions, In: LATA 2007 Pre-proceedings. Reports of the Research Group on Mathematical Linguistics 35/07, Universitat Rovira i Virgili, Tarragona, Spain, ES, 2007, s. 403-411
 Masopust Tomáš, Meduna Alexander: Descriptional Complexity of Semi-Conditional Grammars, In: Information Processing Letters, roč. 104, č. 1, 2007, Amsterdam, NL, s. 29-31, ISSN 0020-0190
 Masopust Tomáš: A Note on the Descriptional Complexity of Semi-Conditional Grammars, In: Information Systems and Formal Models ISIM, WFM '07, Hradec nad Moravici, CZ, SLU, 2007, s. 213-218, ISBN 978-80-7248-0067
 Masopust Tomáš: Formal Models: Regulation and Reduction, Brno, CZ, FIT VUT, 2007, s. 103, ISBN 978-80-214-3550-6
 Masopust Tomáš: Generalized Forbidding Grammars with Linear Productions, In: Third Doctoral Workshop on Mathematical and Engineering Methods in Computer Science (MEMICS 2007), Znojmo, CZ, Novotny, 2007, s. 121-126, ISBN 978-80-7355-077-6
 Masopust Tomáš: Regulated Formal Models and Their Reduction, Brno, CZ, 2007, s. 71
 Masopust Tomáš: Scattered Context Grammars Can Generate the Powers of 2, In: Proceedings of the 13th Conference STUDENT EEICT 2007, Volume 4, Brno, CZ, FEKT VUT, 2007, s. 401-404, ISBN 978-80214-3410-3
 Meduna Alexander, Masopust Tomáš: Self-Regulating Finite Automata, In: Acta Cybernetica, roč. 18, č. 1, 2007, US, s. 135-153, ISSN 0324-721X
2006Masopust Tomáš: An Improvement of the Descriptional Complexity of Grammars Regulated by Context Conditions, In: Second Doctoral Workshop on Mathematical and Engineering Methods in Computer Science (MEMICS 2006), Mikulov, CZ, FIT VUT, 2006, s. 105-112, ISBN 80-214-3287-X
 Masopust Tomáš: Closure Properties of Linear Languages under Operations of Linear Deletion, In: Proceedings of 1st International Workshop WFM'06, Přerov, CZ, MARQ, 2006, s. 45-52, ISBN 80-86840-20-4
 Masopust Tomáš: Closure Properties of Linear Languages under Operations of Linear Deletion, In: Proceedings of the 12th Conference and Competition STUDENT EEICT 2006 Volume 4, Brno, CZ, FIT VUT, 2006, s. 390-394, ISBN 80-214-3163-6
 Masopust Tomáš: Regulární pologrupy, FIT VUT, 2006, s. 12

Zobrazit všechny publikace

Vaše IPv4 adresa: 38.107.179.212
Přepnout na IPv6 spojení

DNSSEC [dnssec]