doc. RNDr.

Tomáš Masopust

Ph.D.

Member of Workgroup


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

Publications

  • 2011

    KŘIVKA, Z.; MASOPUST, T. Cooperating Distributed Grammar Systems with Random Context Grammars as Components. Acta Cybernetica, 2011, vol. 20, no. 2, p. 269-283. ISSN: 0324-721X. Detail

    MEDUNA, A.; ČERMÁK, M.; MASOPUST, T. Some Power-Decreasing Derivation Restrictions in Grammar Systems. Schedae Informaticae, 2011, vol. 2010, no. 19, p. 23-34. ISSN: 0860-0295. Detail

  • 2010

    MASOPUST, T.; GOLDEFUS, F.; MEDUNA, A. Left-Forbidding Cooperating Distributed Grammar Systems. Theoretical Computer Science, 2010, vol. 411, no. 40, p. 3661-3667. ISSN: 0304-3975. Detail

  • 2009

    CSUHAJ-VARJÚ, E.; MASOPUST, T.; VASZIL, G. Cooperating Distributed Grammar Systems with Permitting Grammars as Components. Romanian Journal of Information Science and Technology (ROMJIST), 2009, vol. 12, no. 2, p. 175-189. ISSN: 1453-8245. Detail

    KŘIVKA, Z.; MASOPUST, T. A Note on the Cooperation in Rewriting Systems with Context-Dependency Checking. 11th Italian Conference on Theoretical Computer Science. Cremona: 2009. p. 129-135. Detail

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

    MASOPUST, T. 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. Lecture notes in computer science. Springer-Verlag Berlin Heidelberg: Springer Verlag, 2009. p. 554-565. ISBN: 978-3-642-00981-5. ISSN: 0302-9743. Detail

    MASOPUST, T. On the Descriptional Complexity of Scattered Context Grammars. Theoretical Computer Science, 2009, vol. 410, no. 1, p. 108-112. ISSN: 0304-3975. Detail

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

    MASOPUST, T.; MEDUNA, A. Descriptional Complexity of Three-Nonterminal Scattered Context Grammars: An Improvement. Proceedings of 11th International Workshop on Descriptional Complexity of Formal Systems. Magdeburg: Otto-von-Guericke-University of Magdeburg, 2009. p. 235-245. ISBN: 978-3-940961-31-0. Detail

    MASOPUST, T.; MEDUNA, A. On context-free rewriting with a simple restriction and its computational completeness. RAIRO-THEORETICAL INFORMATICS AND APPLICATIONS, 2009, vol. 43, no. 2, p. 365-378. ISSN: 0988-3754. Detail

    MASOPUST, T.; MEDUNA, A. On Pure Multi-Pushdown Automata that Perform Complete Pushdown Pops. Acta Cybernetica, 2009, vol. 19, no. 2, p. 537-552. ISSN: 0324-721X. Detail

  • 2008

    MASOPUST, T. Descriptional Complexity of Multi-Parallel Grammars. Information Processing Letters, 2008, vol. 108, no. 2, p. 68-70. ISSN: 0020-0190. Detail

    MASOPUST, T.; MEDUNA, A. On Pure Multi-Pushdown Automata that Perform Complete-Pushdown Pops. 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. p. 325-336. ISBN: 978-963-311-367-7. Detail

    MASOPUST, T.; MEDUNA, A. On Descriptional Complexity of Partially Parallel Grammars. Fundamenta Informaticae, 2008, vol. 87, no. 3, p. 407-415. ISSN: 0169-2968. Detail

    MASOPUST, T.; MEDUNA, A.; ŠIMÁČEK, J. Two Power-Decreasing Derivation Restrictions in Generalized Scattered Context Grammars. Acta Cybernetica, 2008, vol. 18, no. 4, p. 783-793. ISSN: 0324-721X. Detail

    MASOPUST, T.; TECHET, J. Leftmost Derivations of Propagating Scattered Context Grammars: A New Proof. DISCRETE MATHEMATICS AND THEORETICAL COMPUTER SCIENCE, 2008, vol. 10, no. 2, p. 39-46. ISSN: 1365-8050. Detail

  • 2007

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

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

    MASOPUST, T. Generalized Forbidding Grammars with Linear Productions. Third Doctoral Workshop on Mathematical and Engineering Methods in Computer Science (MEMICS 2007). Znojmo: Ing. Zdeněk Novotný, CSc., 2007. p. 121-126. ISBN: 978-80-7355-077-6. Detail

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

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

    MASOPUST, T.; MEDUNA, A. Descriptional complexity of semi-conditional grammars. Information Processing Letters, 2007, vol. 104, no. 1, p. 29-31. ISSN: 0020-0190. Detail

    MEDUNA, A.; MASOPUST, T. Self-Regulating Finite Automata. Acta Cybernetica, 2007, vol. 18, no. 1, p. 135-153. ISSN: 0324-721X. Detail

  • 2006

    MASOPUST, T. An Improvement of the Descriptional Complexity of Grammars Regulated by Context Conditions. Second Doctoral Workshop on Mathematical and Engineering Methods in Computer Science (MEMICS 2006). Mikulov: Faculty of Information Technology BUT, 2006. p. 105-112. ISBN: 80-214-3287-X. Detail

Back to top