Search:  
Home page
Faculty
Departments
Official Documents
Study
Research
Computer Centre
Library
Events
News   [rss]
Links
Výběr jazyka
Select Language
Search
Web Stats

 
Your IPv4 address: 38.107.191.113
Switch to IPv6 connection
 
Contact Curriculum Teaching Publications Products Projects

RNDr. Tomáš Masopust, Ph.D.

Publications

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), Vol. 12, No. 2, 2009, Bukurest, RO, p. 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, p. 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, p. 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, Vol. 43, No. 2, 2009, Les Ulis, FR, p. 365-378, ISSN 0988-3754
 Masopust Tomáš, Meduna Alexander: On Pure Multi-Pushdown Automata that Perform Complete Pushdown Pops, In: Acta Cybernetica, Vol. 19, No. 2, 2009, US, p. 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, p. 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, p. 6
 Masopust Tomáš: On the Descriptional Complexity of Scattered Context Grammars, In: Theoretical Computer Science, Vol. 410, No. 1, 2009, Paris, FR, p. 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, Vol. 20, No. 2, 2009, SG, p. 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, p. 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, Vol. 18, No. 4, 2008, US, p. 783-793, ISSN 0324-721X
 Masopust Tomáš, Meduna Alexander: On Descriptional Complexity of Partially Parallel Grammars, In: Fundamenta Informaticae, Vol. 87, No. 3, 2008, Amsterdam, NL, p. 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, p. 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, Vol. 10, No. 2, 2008, Nancy, FR, p. 39-46, ISSN 1365-8050
 Masopust Tomáš: Descriptional Complexity of Multi-Parallel Grammars, In: Information Processing Letters, Vol. 108, No. 2, 2008, Amsterdam, NL, p. 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, p. 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, p. 403-411
 Masopust Tomáš, Meduna Alexander: Descriptional complexity of semi-conditional grammars, In: Information Processing Letters, Vol. 104, No. 1, 2007, Amsterdam, NL, p. 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, p. 213-218, ISBN 978-80-7248-0067
 Masopust Tomáš: Formal models: regulation and reduction, Brno, CZ, FIT VUT, 2007, p. 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, p. 121-126, ISBN 978-80-7355-077-6
 Masopust Tomáš: Regulated Formal Models and Their Reduction, Brno, CZ, 2007, p. 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, p. 401-404, ISBN 978-80214-3410-3
 Meduna Alexander, Masopust Tomáš: Self-Regulating Finite Automata, In: Acta Cybernetica, Vol. 18, No. 1, 2007, US, p. 135-153, ISSN 0324-721X

Show all publications

© Faculty of Information Technology, BUT, Božetěchova 2,
612 66 Brno, Czech Republic
Tel.: +420 54114 1144, Fax: +420 54114 1270
E-mail: info@fit.vutbr.cz, Web: http://www.fit.vutbr.cz/