doc. RNDr.

Tomáš Masopust

Ph.D.

Member of Workgroup


tomas.masopust@upol.cz
75696/BUT personal ID

Publications

  • 2011

    KŘIVKA Zbyněk and MASOPUST Tomáš. Cooperating Distributed Grammar Systems with Random Context Grammars as Components. Acta Cybernetica, vol. 20, no. 2, 2011, pp. 269-283. ISSN 0324-721X.
    Detail

    MEDUNA Alexander, ČERMÁK Martin and MASOPUST Tomáš. Some Power-Decreasing Derivation Restrictions in Grammar Systems. Schedae Informaticae, vol. 2010, no. 19, 2011, pp. 23-34. ISSN 0860-0295.
    Detail

  • 2010

    GOLDEFUS Filip, MASOPUST Tomáš and MEDUNA Alexander. Left-Forbidding Cooperating Distributed Grammar Systems. Theoretical Computer Science, vol. 411, no. 40, 2010, pp. 3661-3667. ISSN 0304-3975.
    Detail

  • 2009

    KŘIVKA Zbyněk and MASOPUST Tomáš. A Note on the Cooperation in Rewriting Systems with Context-Dependency Checking. In: 11th Italian Conference on Theoretical Computer Science. Cremona, 2009, pp. 129-135.
    Detail

    MASOPUST Tomáš. A Note on the Generative Power of Some Simple Variants of Context-Free Grammars Regulated by Context Conditions. In: LATA 2009 proceedings. Lecture notes in computer science, vol. 2009. Springer-Verlag Berlin Heidelberg: Springer Verlag, 2009, pp. 554-565. ISBN 978-3-642-00981-5. ISSN 0302-9743.
    Detail

    CSUHAJ-VARJÚ Erzsébet, MASOPUST Tomáš and VASZIL György. Cooperating Distributed Grammar Systems with Permitting Grammars as Components. Romanian Journal of Information Science and Technology (ROMJIST), vol. 12, no. 2, 2009, pp. 175-189. ISSN 1453-8245.
    Detail

    MASOPUST Tomáš and 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-University of Magdeburg, 2009, pp. 235-245. ISBN 978-3-940961-31-0.
    Detail

    MASOPUST Tomáš and MEDUNA Alexander. On context-free rewriting with a simple restriction and its computational completeness. RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, vol. 43, no. 2, 2009, pp. 365-378. ISSN 0988-3754.
    Detail

    MASOPUST Tomáš and MEDUNA Alexander. On Pure Multi-Pushdown Automata that Perform Complete Pushdown Pops. Acta Cybernetica, vol. 19, no. 2, 2009, pp. 537-552. ISSN 0324-721X.
    Detail

    MASOPUST Tomáš. On the Descriptional Complexity of Scattered Context Grammars. Theoretical Computer Science, vol. 410, no. 1, 2009, pp. 108-112. ISSN 0304-3975.
    Detail

    MASOPUST Tomáš. On the Terminating Derivation Mode in Cooperating Distributed Grammar Systems with Forbidding Components. International Journal of Foundations of Computer Science, vol. 20, no. 2, 2009, pp. 331-340. ISSN 0129-0541.
    Detail

    MASOPUST Tomáš. Regulated Nondeterminism in PDAs: The Non-Regular Case. In: Proceedings of Workshop on Non-Classical Models of Automata and Applications (NCMA). books@ocg.at Band 256. Wroclaw: Austrian Computer Society, 2009, pp. 181-194. ISBN 978-3-85403-256-4.
    Detail

  • 2008

    MASOPUST Tomáš. Descriptional Complexity of Multi-Parallel Grammars. Information Processing Letters, vol. 108, no. 2, 2008, pp. 68-70. ISSN 0020-0190.
    Detail

    MASOPUST Tomáš and TECHET Jiří. Leftmost Derivations of Propagating Scattered Context Grammars: A New Proof. Discrete Mathematics and Theoretical Computer Science, vol. 10, no. 2, 2008, pp. 39-46. ISSN 1365-8050.
    Detail

    MASOPUST Tomáš and MEDUNA Alexander. On Descriptional Complexity of Partially Parallel Grammars. Fundamenta Informaticae, vol. 87, no. 3, 2008, pp. 407-415. ISSN 0169-2968.
    Detail

    MASOPUST Tomáš and 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, pp. 325-336. ISBN 978-963-311-367-7.
    Detail

    MASOPUST Tomáš, MEDUNA Alexander and ŠIMÁČEK Jiří. Two Power-Decreasing Derivation Restrictions in Generalized Scattered Context Grammars. Acta Cybernetica, vol. 18, no. 4, 2008, pp. 783-793. ISSN 0324-721X.
    Detail

  • 2007

    MASOPUST Tomáš. A Note on the Descriptional Complexity of Semi-Conditional Grammars. In: Information Systems and Formal Models ISIM, WFM '07. Hradec nad Moravici: Silesian University, 2007, pp. 213-218. ISBN 978-80-7248-0067.
    Detail

    MASOPUST Tomáš and MEDUNA Alexander. Descriptional Complexity of Generalized Forbidding Grammars. In: Proceedings of 9th International Workshop on Descriptional Complexity of Formal Systems. High Tatras, Slovakia: University of Pavol Jozef Šafárik, 2007, pp. 170-177. ISBN 978-80-7097-688-3.
    Detail

    MASOPUST Tomáš and 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, pp. 403-411.
    Detail

    MASOPUST Tomáš and MEDUNA Alexander. Descriptional complexity of semi-conditional grammars. Information Processing Letters, vol. 104, no. 1, 2007, pp. 29-31. ISSN 0020-0190.
    Detail

    MASOPUST Tomáš. Formal models: regulation and reduction. Brno: Faculty of Information Technology BUT, 2007. ISBN 978-80-214-3550-6.
    Detail

    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, pp. 121-126. ISBN 978-80-7355-077-6.
    Detail

    MASOPUST Tomáš. Scattered Context Grammars Can Generate the Powers of 2. In: Proceedings of the 13th Conference STUDENT EEICT 2007, Volume 4. Brno: Faculty of Electrical Engineering and Communication BUT, 2007, pp. 401-404. ISBN 978-80214-3410-3.
    Detail

    MEDUNA Alexander and MASOPUST Tomáš. Self-Regulating Finite Automata. Acta Cybernetica, vol. 18, no. 1, 2007, pp. 135-153. ISSN 0324-721X.
    Detail

  • 2006

    MASOPUST 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: Faculty of Information Technology BUT, 2006, pp. 105-112. ISBN 80-214-3287-X.
    Detail

    MASOPUST Tomáš. Closure Properties of Linear Languages under Operations of Linear Deletion. In: Proceedings of 1st International Workshop WFM'06. Přerov, 2006, pp. 45-52. ISBN 80-86840-20-4.
    Detail

    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: Faculty of Information Technology BUT, 2006, pp. 390-394. ISBN 80-214-3163-6.
    Detail

Back to top