Výpis publikací

KOMENDA, Jan, Tomáš MASOPUST a Jan H. VAN SCHUPPEN. Coordination Control of Distributed Discrete-Event Systems. In Control of Discrete-event Systems. Berlin: Springer, 2013, s. 147-167. ISBN 978-1-4471-4275-1. Dostupné z: https://dx.doi.org/10.1007/978-1-4471-4276-8.

HAAR, Stefan a Tomáš MASOPUST. Languages, Decidability, and Complexity. In Control of Discrete-event Systems. Berlin: Springer, 2013, s. 23-43. LNCIS 433. ISBN 978-1-4471-4275-1. Dostupné z: https://dx.doi.org/10.1007/978-1-4471-4276-8.

KOMENDA, Jan, Tomáš MASOPUST a Jan H. VAN SCHUPPEN. Supervisory Control of Distributed Discrete-Event Systems. In Control of Discrete-event Systems. Berlin: Springer, 2013, s. 107-126. LNCIS 433. ISBN 978-1-4471-4275-1. Dostupné z: https://dx.doi.org/10.1007/978-1-4471-4276-8.

MASOPUST, Tomáš a Jan H. VAN SCHUPPEN. Supervisory Control with Complete Observations. In Control of Discrete-event Systems. Berlin: Springer, 2013, s. 45-64. LNCIS 433. ISBN 978-1-4471-4275-1. Dostupné z: https://dx.doi.org/10.1007/978-1-4471-4276-8.

MASOPUST, Tomáš. A note on controllability of deterministic context-free systems. Automatica. Elsevier, 2012, roč. 48, č. 8, s. 1934-1937. ISSN 0005-1098. Dostupné z: https://dx.doi.org/10.1016/j.automatica.2012.06.004.

JIRÁSKOVÁ, Galina a Tomáš MASOPUST. On a structural property in the state complexity of projected regular languages. Theoretical Computer Science. Amsterdam, North Holland: Elsevier Science Publishers, 2012, roč. 449, s. 93-105. ISSN 0304-3975. Dostupné z: https://dx.doi.org/10.1016/j.tcs.2012.04.009.

KOMENDA, Jan, Tomáš MASOPUST a Jan H. VAN SCHUPPEN. On Algorithms and Extensions of Coordination Control of Discrete-Event Systems. In Antonio Ramírez-Treviño, Jean-Jacques Lesage, Manuel Silva. International Workshop on Discrete Event Systems (WODES 2012). IFAC, 2012, s. 245-250. ISSN 1474-6670.

KOMENDA, Jan, Tomáš MASOPUST a Jan H. VAN SCHUPPEN. On Conditional Decomposability. Systems & Control Letters. 2012, roč. 61, č. 12, s. 1260-1268. Dostupné z: https://dx.doi.org/10.1016/j.sysconle.2012.07.013.

JIRÁSKOVÁ, Galina a Tomáš MASOPUST. On Properties and State Complexity of Deterministic State-Partition Automata. In J.C.M. Baeten, T. Ball, and F.S. de Boer. IFIP Theoretical Computer Science 2012. Berlin, 2012, s. 164-178. ISBN 978-3-642-33474-0. Dostupné z: https://dx.doi.org/10.1007/978-3-642-33475-7_12.

DASSOW, Jürgen a Tomáš MASOPUST. On restricted context-free grammars. Journal of Computer and System Sciences. Elsevier, 2012, roč. 78, č. 1, s. 293-304. ISSN 0022-0000. Dostupné z: https://dx.doi.org/10.1016/j.jcss.2011.05.008.

JIRÁSKOVÁ, Galina a Tomáš MASOPUST. On the State and Computational Complexity of the Reverse of Acyclic Minimal DFAs. In N. Moreira and R. Reis. 17th International Conference on Implementation and Application of Automata (CIAA 2012). Berlin: Springer, 2012, s. 229-239. ISSN 0302-9743.

KOMENDA, Jan, Tomáš MASOPUST a Jan H. van SCHUPPEN. Supervisory Control Synthesis of Discrete-Event Systems using a Coordination Scheme. Automatica. Elsevier, 2012, roč. 48, č. 2, s. 247-254. ISSN 0005-1098. Dostupné z: https://dx.doi.org/10.1016/j.automatica.2011.07.008.

CSUHAJ-VARJÚ, Erzsebet, Tomáš MASOPUST a Gyorgy VASZIL. Blackhole Pushdown Automata. Fundamenta Informaticae. Polsko: IOS Press, Nizozemí, 2011, roč. 112, 2-3, s. 137-156. ISSN 0169-2968. Dostupné z: https://dx.doi.org/10.3233/FI-2011-584.

JIRÁSKOVÁ, Galina a Tomáš MASOPUST. Complexity in Union-Free Regular Languages. International Journal of Foundations of Computer Science. World Scientific, 2011, roč. 22, č. 7, s. 1639-1653. ISSN 0129-0541. Dostupné z: https://dx.doi.org/10.1142/S0129054111008933.

BOUTIN, Olivier, Jan KOMENDA, Tomáš MASOPUST, Nicola PAMBAKIAN, Jan H. VAN SCHUPPEN, Pia L. KEMPKER a André C. M. RAN. Control of Distributed Systems: Tutorial and Overview. European Journal of Control. France: Lavoisier, 2011, roč. 17, 5-6, s. 579-602. ISSN 0947-3580. Dostupné z: https://dx.doi.org/10.3166/ejc.17.579-602.

KŘIVKA, Zbyněk a Tomáš MASOPUST. Cooperating Distributed Grammar Systems with Random Context Grammars as Components. Acta Cybernetica. Szeged: University Szeged, 2011, roč. 20, č. 2, s. 269-283. ISSN 0324-721X.

KOMENDA, Jan, Tomáš MASOPUST a Jan H. VAN SCHUPPEN. Coordinated Control of Discrete Event Systems with Nonprefix-Closed Languages. In Bittanti, Sergio (Politecnico di Milano, Italy), Cenedese, Angelo (University of Padova, Italy), Zampieri, Sandro (University of Padova, , Italy). IFAC World Congress 2011. Milano, Italy: International Federation of Automatic Control (IFAC), 2011, s. 6982-6987. ISBN 978-3-902661-93-7.

OLIVIER, Boutin, Jan KOMENDA, Tomáš MASOPUST, Schmidt KLAUS a Jan H. VAN SCHUPPEN. Hierarchical Control with Partial Observations: Sufficient Conditions. In Edwin K.P. Chong, Marios M. Polycarpou. 50th IEEE Conference on Decision and Control and European Control Conference. Orlando, Florida, 2011, 6 s.

JIRÁSKOVÁ, Galina a Tomáš MASOPUST. State Complexity of Projected Languages. In M. Holzer, M. Kutrib, and G. Pighizzini. DCFS 2011, LNCS 6808. Heidelberg: Springer, 2011, s. 198-211. ISSN 0302-9743.

KOMENDA, Jan, Tomáš MASOPUST a Jan H. VAN SCHUPPEN. Synthesis of controllable and normal sublanguages for discrete-event systems using a coordinator. Systems & Control Letters. Elsevier B.V., 2011, roč. 60, č. 7, s. 492-502. ISSN 0167-6911.

CSUHAJ-VARJÚ, Erzsébet, Tomáš MASOPUST a György VASZIL. Blackhole State-Controlled Regulated Pushdown Automata. In Second Workshop on Non-Classical Models for Automata and Applications (NCMA 2010), books@ocg.at, band 263. 2010, s. 45-56. ISBN 978-3-85403-263-2.

MASOPUST, Tomáš. Bounded Number of Parallel Productions in Scattered Context Grammars with Three Nonterminals. Fundamenta Informaticae. Poland: IOS Press, The Netherlands, 2010, roč. 99, č. 4, s. 473-480. ISSN 0169-2968.

JIRÁSKOVÁ, Galina a Tomáš MASOPUST. Complexity in Union-Free Regular Languages. In DLT 2010, LNCS 6224. London, ON, Canada: Springer-Verlag Berlin Heidelberg, 2010, s. 255-266. ISBN 978-3-642-14454-7.

GOLDEFUS, Filip, Tomáš MASOPUST a Alexander MEDUNA. Left-forbidding cooperating distributed grammar systems. Theoretical Computer Science. Amsterdam, North Holland: Elsevier Science Publishers, 2010, roč. 411, 40-42, s. 3661-3667. ISSN 0304-3975.

DASSOW, Jürgen a Tomáš MASOPUST. On restricted context-free grammars. In DLT 2010, LNCS 6224. London, ON, Canada: Springer-Verlag Berlin Heidelberg, 2010, s. 434-435. ISBN 978-3-642-14454-7.

MASOPUST, Tomáš. Regulated Nondeterminism in Pushdown Automata: The Non-Regular Case. Fundamenta Informaticae. Poland: IOS Press, The Netherlands, 2010, roč. 104, 1-2, s. 111-124. ISSN 0169-2968.

MASOPUST, Tomáš. Simple restriction in context-free rewriting. Journal of Computer and System Sciences. Elsevier, 2010, roč. 76, č. 8, s. 837-846. ISSN 0022-0000.

KOMENDA, Jan a Tomáš MASOPUST. Supremal Normal Sublanguages in Hierarchical Supervisory Control. In 10th International Workshop on Discrete Event Systems (WODES 2010). Berlin, 2010, s. 121-126.

KOMENDA, Jan, Tomáš MASOPUST a Jan H. VAN SCHUPPEN. Synthesis of Safe Sublanguages satisfying Global Specification using Coordination Scheme for Discrete-Event Systems. In 10th International Workshop on Discrete Event Systems (WODES 2010). Berlin, 2010, s. 436-441.

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

MASOPUST, Tomáš. A Note on the Generative Power of Some Simple Variants of Context-Free Grammars Regulated by Context Conditions. In LATA 2009, Lecture Notes in Computer Science 5457. Tarragona, Spain, 2009, s. 554-565. ISSN 0302-9743.

CSUHAJ-VARJÚ, Erzsébet, Tomáš MASOPUST a György VASZIL. Cooperating Distributed Grammar Systems with Permitting Grammars as Components. Romanian Journal of Information Science and Technology. Romanian Academy, 2009, roč. 12, č. 2, s. 175-189. ISSN 1453-8245.

MASOPUST, Tomáš a Alexander MEDUNA. 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, Germany, 2009, s. 235-245. ISBN 978-3-940961-31-0.

MASOPUST, Tomáš a Alexander MEDUNA. On context-free rewriting with a simple restriction and its computational completeness. RAIRO - Theoretical Informatics and Applications. Les Ulis (Francie): EDP Sciences, 2009, roč. 43, č. 2, s. 365-378. ISSN 0988-3754.

MASOPUST, Tomáš a Alexander MEDUNA. On Pure Multi-Pushdown Automata that Perform Complete Pushdown Pops. Acta Cybernetica. Szeged: University Szeged, 2009. ISSN 0324-721X.

MASOPUST, Tomáš. On the Descriptional Complexity of Scattered Context Grammars. Theoretical Computer Science. Amsterdam, North Holland: Elsevier Science Publishers, 2009, roč. 410, 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. World Scientific, 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, Poland: books@ocg.at, Band 256, Austrian Computer Society, 2009, s. 181-194. ISBN 978-3-85403-256-4.

MASOPUST, Tomáš. Descriptional Complexity of Multi-Parallel Grammars. Information Processing Letters. Elsevier, 2008, roč. 108, č. 2, s. 68-70. ISSN 0020-0190.

MASOPUST, Tomáš a Jiří TECHET. Leftmost Derivations of Propagating Scattered Context Grammars: A New Proof. Discrete Mathematics & Theoretical Computer Science. France: DMTCS, 2008, roč. 10, č. 2, s. 39-46. ISSN 1365-8050.

MASOPUST, Tomáš a Alexander MEDUNA. On Descriptional Complexity of Partially Parallel Grammars. Fundamenta Informaticae. Polsko: IOS Press, Nizozemí, 2008, roč. 87, č. 3, s. 407-415. ISSN 0169-2968.

MASOPUST, Tomáš a Alexander MEDUNA. 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, Hungary: Computer and Automation Research Institute, Hungarian Academy of Sciences, 2008, s. 325-336. ISBN 978-963-311-367-7.

MASOPUST, Tomáš, Alexander MEDUNA a Jiří ŠIMÁČEK. Two Power-Decreasing Derivation Restrictions in Generalized Scattered Context Grammars. Acta Cybernetica. Szeged: University Szeged, 2008, roč. 18, č. 4, s. 783-793. ISSN 0324-721X.

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, s. 213-218. ISBN 978-80-7248-0067.

MASOPUST, Tomáš a Alexander MEDUNA. 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, s. 170-177. ISBN 978-80-7097-688-3.

MASOPUST, Tomáš a Alexander MEDUNA. 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áš. Descriptional Complexity of Semi-Conditional Grammars. Information Processing Letters. Elsevier, 2007, roč. 104, č. 1, s. 29-31. ISSN 0020-0190.

MASOPUST, Tomáš. Formal Models: Regulation and Reduction. Brno: FIT VUT Brno, 2007, 103 s. 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, 2007, s. 121-126, 7 s. 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: FEKT VUT Brno, 2007, s. 401-404. ISBN 978-80214-3410-3.

MEDUNA, Alexander a Tomáš MASOPUST. Self-Regulating Finite Automata. Acta Cybernetica. Szeged: University Szeged, 2007, roč. 18, č. 1, s. 135-153. ISSN 0324-721X.

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: FIT VUT Brno, 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.