RNDr. Tomáš Masopust, Ph.D.

Publikace

2011KŘIVKA Zbyněk a MASOPUST Tomáš. Cooperating Distributed Grammar Systems with Random Context Grammars as Components. Acta Cybernetica. 2011, roč. 20, č. 2, s. 269-283. ISSN 0324-721X.
 MEDUNA Alexander, ČERMÁK Martin a MASOPUST Tomáš. Some Power-Decreasing Derivation Restrictions in Grammar Systems. Schedae Informaticae. Krakov: 2011, roč. 2010, č. 19, s. 23-34. ISSN 0860-0295.
2010GOLDEFUS Filip, MASOPUST Tomáš a MEDUNA Alexander. Left-Forbidding Cooperating Distributed Grammar Systems. Theoretical Computer Science. Paris: Elsevier Science, 2010, roč. 40, č. 411, s. 3661-3667. ISSN 0304-3975.
2009CSUHAJ-VARJÚ Erzsébet, MASOPUST Tomáš a VASZIL György. Cooperating Distributed Grammar Systems with Permitting Grammars as Components. Romanian Journal of Information Science and Technology (ROMJIST). Bukurest: Romanian Academy, Publishing House of the Romanian Academy, 2009, roč. 12, č. 2, s. 175-189. ISSN 1453-8245.
 KŘIVKA Zbyněk a MASOPUST Tomáš. A Note on the Cooperation in Rewriting Systems with Context-Dependency Checking. In: 11th Italian Conference on Theoretical Computer Science. Cremona, 2009, s. 129-135.
 MASOPUST Tomáš a 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: Otto-von-Guericke-Universität Magdeburg, 2009, s. 235-245. ISBN 978-3-940961-31-0.
 MASOPUST Tomáš a MEDUNA Alexander. On Pure Multi-Pushdown Automata that Perform Complete Pushdown Pops. Acta Cybernetica. 2009, roč. 19, č. 2, s. 537-552. ISSN 0324-721X.
 MASOPUST Tomáš a MEDUNA Alexander. On context-free rewriting with a simple restriction and its computational completeness. RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications. Les Ulis: EDP Sciences, 2009, roč. 43, č. 2, s. 365-378. ISSN 0988-3754.
 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: Springer Verlag, 2009, s. 554-565. ISBN 978-3-642-00981-5. ISSN 0302-9743.
 MASOPUST Tomáš. On the Descriptional Complexity of Scattered Context Grammars. Theoretical Computer Science. Paris: Elsevier Science, 2009, roč. 410, č. 1, s. 108-112. ISSN 0304-3975.
 MASOPUST Tomáš. On the Terminating Derivation Mode in Cooperating Distributed Grammar Systems with Forbidding Components. International Journal of Foundations of Computer Science. 2009, roč. 20, č. 2, 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: Osterreichische Computer Gesellschaft, 2009, s. 181-194. ISBN 978-3-85403-256-4.
2008MASOPUST Tomáš a MEDUNA Alexander. On Descriptional Complexity of Partially Parallel Grammars. Fundamenta Informaticae. Amsterdam: IOS Press, 2008, roč. 87, č. 3, s. 407-415. ISSN 0169-2968.
 MASOPUST Tomáš a 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: Computer and Automation Research Institute, Hungarian Academy of Sciences, 2008, s. 325-336. ISBN 978-963-311-367-7.
 MASOPUST Tomáš a TECHET Jiří. Leftmost Derivations of Propagating Scattered Context Grammars: A New Proof. Discrete Mathematics and Theoretical Computer Science. Nancy: 2008, roč. 10, č. 2, s. 39-46. ISSN 1365-8050.
 MASOPUST Tomáš, MEDUNA Alexander a ŠIMÁČEK Jiří. Two Power-Decreasing Derivation Restrictions in Generalized Scattered Context Grammars. Acta Cybernetica. 2008, roč. 18, č. 4, s. 783-793. ISSN 0324-721X.
 MASOPUST Tomáš. Descriptional Complexity of Multi-Parallel Grammars. Information Processing Letters. Amsterdam: Elsevier Science, 2008, roč. 108, č. 2, s. 68-70. ISSN 0020-0190.
2007MASOPUST Tomáš a MEDUNA Alexander. Descriptional Complexity of Generalized Forbidding Grammars. In: Proceedings of 9th International Workshop on Descriptional Complexity of Formal Systems. High Tatras, Slovakia: Univerzita Pavla Jozefa Šafárika v Košiciach, 2007, s. 170-177. ISBN 978-80-7097-688-3.
 MASOPUST Tomáš a 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, 2007, s. 403-411.
 MASOPUST Tomáš a MEDUNA Alexander. Descriptional Complexity of Semi-Conditional Grammars. Information Processing Letters. Amsterdam: Elsevier Science, 2007, roč. 104, č. 1, s. 29-31. ISSN 0020-0190.
 MASOPUST Tomáš. Formal Models: Regulation and Reduction. Brno: Fakulta informačních technologií VUT v Brně, 2007. ISBN 978-80-214-3550-6.
 MASOPUST Tomáš. A Note on the Descriptional Complexity of Semi-Conditional Grammars. In: Information Systems and Formal Models ISIM, WFM '07. Hradec nad Moravici: Slezská univerzita v Opavě, 2007, s. 213-218. ISBN 978-80-7248-0067.
 MASOPUST Tomáš. Generalized Forbidding Grammars with Linear Productions. In: Third Doctoral Workshop on Mathematical and Engineering Methods in Computer Science (MEMICS 2007). Znojmo: Ing. Zdeněk Novotný, CSc., 2007, s. 121-126. ISBN 978-80-7355-077-6.
 MASOPUST Tomáš. Scattered Context Grammars Can Generate the Powers of 2. In: Proceedings of the 13th Conference STUDENT EEICT 2007, Volume 4. Brno: Fakulta elektrotechniky a komunikačních technologií VUT v Brně, 2007, s. 401-404. ISBN 978-80214-3410-3.
 MEDUNA Alexander a MASOPUST Tomáš. Self-Regulating Finite Automata. Acta Cybernetica. 2007, roč. 18, č. 1, 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: Fakulta informačních technologií VUT v Brně, 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: 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: Fakulta informačních technologií VUT v Brně, 2006, s. 390-394. ISBN 80-214-3163-6.

Zobrazit všechny publikace

Vaše IPv4 adresa: 3.81.28.94
Přepnout na https