• DBLP
• Google Scholar
• ResearchGate
• MathSciNet
• Publications since 2010
• Publications till 2009
•
My Erdős number is 3, see ams.org.
Journal papers
• 2013 • 2012 • 2011 • 2010 • 2009 • 2008 • 2007 •2013 | Masopust, T., A Note on Limited Pushdown Alphabets in Stateless Deterministic Pushdown Automata, International Journal of Foundations of Computer Science 24 (3), 319-328, 2013, pdf, doi:10.1142/S0129054113500068 |
2012 | Komenda, J., Masopust, T., van Schuppen, J.H., On Conditional Decomposability, Systems & Control Letters 61 (12), 1260-1268, 2012, pdf, doi:10.1016/j.sysconle.2012.07.013 |
Masopust, T., A note on controllability of deterministic context-free systems, Automatica 48 (8), 1934-1937, 2012, pdf, doi:10.1016/j.automatica.2012.06.004 | |
Jirásková, G., Masopust, T., On a structural property in the state complexity of projected regular languages, Theoretical Computer Science 449, 93-105, 2012, pdf, doi:10.1016/j.tcs.2012.04.009 | |
Komenda, J., Masopust, T., van Schuppen, J.H., Supervisory Control Synthesis of Discrete-Event Systems using a Coordination Scheme, Automatica 48 (2), 247-254, 2012, pdf, doi:10.1016/j.automatica.2011.07.008 | |
Dassow, J., Masopust, T., On restricted context-free grammars, Journal of Computer and System Sciences 78 (1), 293-304, 2012, pdf, doi:10.1016/j.jcss.2011.05.008 | |
2011 | Jirásková, G., Masopust, T., Complexity in Union-Free Regular Languages, International Journal of Foundations of Computer Science 22 (7), 1639-1653, 2011, pdf, doi:10.1142/S0129054111008933 |
van Schuppen, J. H., Boutin, O., Kempker, P. L., Komenda, J., Masopust, T., Pambakian, N., Ran, A. C. M., Control of Distributed Systems: Tutorial and Overview, European Journal of Control 17 (5-6), 579-602, 2011, pdf, doi:10.3166/ejc.17.579-602 | |
Komenda, J., Masopust, T., van Schuppen, J.H., Synthesis of Controllable and Normal Sublanguages for Discrete-Event Systems using a Coordinator, Systems & Control Letters 60 (7), 492-502, 2011, pdf, doi:10.1016/j.sysconle.2011.04.005 | |
Csuhaj-Varjú, E., Masopust, T., Vaszil, Gy., Blackhole Pushdown Automata, Fundamenta Informaticae 112 (2-3), 137-156, 2011, pdf, doi:10.3233/FI-2011-584 | |
Křivka, Z., Masopust, T., Cooperating Distributed Grammar Systems with Random Context Grammars as Components, Acta Cybernetica 20 (2), 269-283, 2011 pdf | |
2010 | Masopust, T., Regulated nondeterminism in pushdown automata: the non-regular case, Fundamenta Informaticae 104, 111-124, 2010, pdf, doi:10.3233/FI-2010-338 |
Goldefus, F., Masopust, T., Meduna, A., Left-forbidding cooperating distributed grammar systems, Theoretical Computer Science 411, 3661-3667, 2010, pdf, doi:10.1016/j.tcs.2010.06.010 | |
Masopust T., Bounded Number of Parallel Productions in Scattered Context Grammars with Three Nonterminals, Fundamenta Informaticae 99 (4), 473-480, 2010, pdf, doi:10.3233/FI-2010-258 | |
Masopust T., Simple restriction in context-free rewriting, Journal of Computer and System Sciences 76 (8), 837-846, 2010, pdf, doi:10.1016/j.jcss.2010.04.001 | |
2009 | Csuhaj-Varjú, E., Masopust, T., Vaszil, G., Cooperating Distributed Grammar Systems with Permitting Grammars as Components, Romanian Journal of Information Science and Technology 12 (2), 175-189, 2009, pdf |
Masopust, T., Meduna, A., On context-free rewriting with a simple restriction and its computational completeness, RAIRO - Theoretical Informatics and Applications 43 (2), 365-378, 2009, pdf, doi:10.1051/ita/2009002 | |
Masopust, T., Meduna, A., On Pure Multi-Pushdown Automata that Perform Complete Pushdown Pops, Acta Cybernetica 19 (2), 537-552, 2009, pdf | |
Masopust, T., On the Descriptional Complexity of Scattered Context Grammars, Theoretical Computer Science 410 (1), 108-112, 2009, pdf, doi:10.1016/j.tcs.2008.10.017 | |
Masopust, T., On the Terminating Derivation Mode in Cooperating Distributed Grammar Systems with Forbidding Components, International Journal of Foundations of Computer Science 20 (2), 331-340, 2009, pdf, doi:10.1142/S0129054109006589 | |
2008 | Masopust, T., Meduna, A., Šimáček, J., Two Power-Decreasing Derivation Restrictions in Generalized Scattered Context Grammars, Acta Cybernetica 18 (4), 783-793, 2008, pdf |
Masopust, T., Meduna, A., On Descriptional Complexity of Partially Parallel Grammars, Fundamenta Informaticae 87 (3), 407-415, 2008, pdf | |
Masopust, T., Techet, J., Leftmost Derivations of Propagating Scattered Context Grammars: A New Proof, Discrete Mathematics and Theoretical Computer Science 10 (2), 39-46, 2008, pdf | |
Masopust, T., Descriptional Complexity of Multi-Parallel Grammars, Information Processing Letters 108 (2), 68-70, 2008, pdf, doi:10.1016/j.ipl.2008.04.002 | |
2007 | Masopust, T., Meduna, A., Descriptional complexity of semi-conditional grammars, Information Processing Letters 104 (1), 29-31, 2007, pdf, doi:10.1016/j.ipl.2007.05.002 |
Meduna, A., Masopust, T., Self-Regulating Finite Automata, Acta Cybernetica 18 (1), 135-153, 2007, pdf |
Conference papers
• 2013 • 2012 • 2011 • 2010 • 2009 • 2008 • 2007 •2013 | Jirásková, G., Masopust, T., On the State Complexity of the Reverse of R- and J-trivial Regular Languages, H. Jürgensen and R. Reis (Eds.), Proc. of DCFS 2013, LNCS 8031, pp. 136-147. Springer Berlin Heidelberg 2013, pdf. The original publication is available at www.springerlink.com. |
Czerwiński, W., Martens, W., Masopust, T., Efficient Separability of Regular Languages by Subsequences and Suffixes, F. V. Fomin, R. Freivalds, M. Kwiatkowska, D. Peleg (Eds.), Proc. of ICALP 2013, LNCS 7966, pp. 150-161. Springer Berlin Heidelberg 2013, pdf. The original publication is available at www.springerlink.com. | |
2012 | Komenda, J., Masopust, T., van Schuppen J.H., On Algorithms and Extensions of Coordination Control of Discrete-Event Systems, A. Ramírez-Treviño, J.-J. Lesage, M. Silva (Eds.), WODES 2012, Guadalajara, Mexico, IFAC, pp. 245-250, 2012, pdf. The original publication is available at www.ifac-papersonline.net. (Note: Proposition 17 is not correct.) |
Jirásková, G., Masopust, T., On Properties and State Complexity of Deterministic State-Partition Automata, IFIP Theoretical Computer Science (TCS 2012), J.C.M. Baeten, T. Ball, and F.S. de Boer (Eds.): LNCS 7604, pp. 164-178, IFIP International Federation for Information Processing (2012), pdf. The original publication is available at www.springerlink.com. | |
Jirásková, G., Masopust, T., On the State and Computational Complexity of the Reverse of Acyclic Minimal DFAs, N. Moreira and R. Reis (Eds.), Proc. of CIAA 2012, LNCS 7381, pp. 229-239. Springer, Berlin, 2012, pdf. The original publication is available at www.springerlink.com. | |
2011 | Boutin, O., Komenda, J., Masopust, T., Schmidt, K., van Schuppen, J.H., Hierarchical Control with Partial Observations: Sufficient Conditions, Proc. of IEEE Conference on Decision and Control and European Control Conference, Orlando, Florida, pp. 1817-1822, 2011, pdf, doi:10.1109/CDC.2011.6160686 |
Jirásková, G., Masopust, T., State Complexity of Projected Languages, M. Holzer, M. Kutrib, and G. Pighizzini (Eds.), Proc. of DCFS 2011, LNCS 6808, pp. 198-211. Springer, Heidelberg, 2011, pdf. The original publication is available at www.springerlink.com. | |
Komenda, J., Masopust, T., van Schuppen, J.H., Coordinated Control of Discrete Event Systems with Nonprefix-Closed Languages, Proc. of IFAC WC 2011, pp. 6982-6987, Milano, Italy, 2011, pdf, doi:10.3182/20110828-6-IT-1002.00173 | |
2010 | Csuhaj-Varjú, E., Masopust, T., Vaszil, Gy., Blackhole State-Controlled Regulated Pushdown Automata, Proc. of Second Workshop on Non-Classical Models for Automata and Applications (NCMA 2010), Bordihn, H. and Freund, R. and Hinze, T. and Holzer, M. and Kutrib, M. and Otto, F. (eds.), books@ocg.at, band 263, Österreichische Computer Gesellschaft, Wien, 45-56, 2010, pdf |
Jirásková, G., Masopust, T., Complexity in Union-Free Regular Languages, Proc. of Developments in Language Theory (DLT 2010), Gao, Y., Lu, H., Seki, S., Yu, S., LNCS 6224, Springer, Berlin, 255-266, 2010, pdf. The original publication is available at www.springerlink.com. | |
Komenda, J., Masopust, T., van Schuppen, J. H., Synthesis of Safe Sublanguages satisfying Global Specification using Coordination Scheme for Discrete-Event Systems, Proc. of Workshop on Discrete Event Systems (WODES 2010), Raisch, J., Giua, A., Lafortune, S., Moor, Th., IFAC, Laxenburg, 436-441, 2010, pdf, doi:10.3182/20100830-3-DE-4013.00070 | |
Komenda, J., Masopust, T., Supremal Normal Sublanguages in Hierarchical Supervisory Control, Proc. of Workshop on Discrete Event Systems (WODES 2010), Raisch, J., Giua, A., Lafortune, S., Moor, Th., IFAC, Laxenbourg, 121-126, 2010, pdf, doi:10.3182/20100830-3-DE-4013.00020 | |
2009 | Křivka, Z., Masopust, T., A Note on the Cooperation in Rewriting Systems with Context-Dependency Checking, Proc. of 11th Italian Conference on Theoretical Computer Science, Cremona, IT, p. 129-135, 2009, pdf |
Masopust, T., Meduna, A., Descriptional Complexity of Three-Nonterminal Scattered Context Grammars: An Improvement, Proc. of 11th International Workshop on Descriptional Complexity of Formal Systems (DCFS 2009), Magdeburg, Germany, p. 235-245, 2009, pdf | |
Masopust, T., A Note on the Generative Power of Some Simple Variants of Context-Free Grammars Regulated by Context Conditions, Proc. of LATA 2009, LNCS 5457, Springer, Berlin, p. 554-565, 2009, pdf. The original publication is available at www.springerlink.com. | |
Masopust, T., Regulated Nondeterminism in PDAs: The Non-Regular Case, Proc. of Workshop on Non-Classical Models of Automata and Applications (NCMA 2009), Wroclaw, Poland, ocg, p. 181-194, 2009, pdf | |
2008 | Masopust, T., Meduna, A., On Pure Multi-Pushdown Automata that Perform Complete-Pushdown Pops, Proc. of 12th International Conference on Automata and Formal Languages (AFL 2008), Balatonfured, Hungary, p. 325-336, 2008, pdf |
2007 | Masopust, T., Meduna, A., Descriptional Complexity of Generalized Forbidding Grammars, Proc. of 9th International Workshop on Descriptional Complexity of Formal Systems, High Tatras, Slovakia, p. 170-177, 2007, pdf |
Masopust, T., Meduna, A., Descriptional Complexity of Grammars Regulated by Context Conditions, Pre-proc. of LATA 2007. Reports of the Research Group on Mathematical Linguistics 35/07, Universitat Rovira i Virgili, Tarragona, Spain, p. 403-411, 2007, pdf | |
Masopust, T., Scattered Context Grammars Can Generate the Powers of 2, Proc. of the 13th Conference STUDENT EEICT 2007, Volume 4, Brno, Czech Republic, p. 401-404, 2007, pdf |
Chapters in monographs
2013 | Komenda, J., Masopust, T., van Schuppen J.H., Coordination Control of Distributed Discrete-Event Systems, in Control of Discrete-event Systems, C. Seatzu, M. Silva, J.H. van Schuppen (Eds.), LNCIS 433, pp. 147-167. Springer, Berlin, 2013. The original publication is available at www.springerlink.com. |
Komenda, J., Masopust, T., van Schuppen J.H., Supervisory Control of Distributed Discrete-Event Systems, in Control of Discrete-event Systems, C. Seatzu, M. Silva, J.H. van Schuppen (Eds.), LNCIS 433, pp. 107-126. Springer, Berlin, 2013. The original publication is available at www.springerlink.com. | |
Masopust, T., van Schuppen J.H., Supervisory Control with Complete Observations, in Control of Discrete-event Systems, C. Seatzu, M. Silva, J.H. van Schuppen (Eds.), LNCIS 433, pp. 45-64. Springer, Berlin, 2013. The original publication is available at www.springerlink.com. | |
Haar, S., Masopust, T., Languages, Decidability, and Complexity, in Control of Discrete-event Systems, C. Seatzu, M. Silva, J.H. van Schuppen (Eds.), LNCIS 433, pp. 23-43. Springer, Berlin, 2013. The original publication is available at www.springerlink.com. |
Monographs
2007 | Masopust, T., Formal models: regulation and reduction, Brno, Czech Republic, FIT VUT, 2007, pdf |
Abstracts
2012 | libFAUDES -- A Software Library for Supervisory Control, composed by Moor, T., Schmidt, K., Masopust, T., presented at CIAA 2012 demo session, Porto, Portugal, 2012, pdf |
Preprints
![]() | Komenda, J., Masopust, T., van Schuppen J.H., Coordination Control of Discrete-Event Systems Revisited, pdf |
![]() | Masopust, T., A Note on Undecidability of Observation Consistency for Non-Regular Languages, unpublished (the problem formulated there still open for regular languages) pdf, |
![]() | Jirásková, G., Masopust, T., Properties and Complexity of Deterministic State-Partition Automata, full version of the IFIP TCS 2012 conference paper, pdf, posted here 24.10.2012. |
![]() | Komenda, J., Masopust, T., Supervisory Control of Discrete-Event Systems, a brief intro, pdf, posted here 27.6.2013. |
![]() | Komenda, J., Masopust, T., Coordination Control of Distributed Discrete-Event Systems, a brief intro, pdf, posted here 27.6.2013. |
![]() | Masopust, T., Ricker, L., Another Approach to Conditional Decomposability for Discrete-Event Systems, unpublished, 2012, pdf, posted here 5.7.2013. |
![]() | Komenda, J., Masopust, T., A Bridge between Decentralized and Coordination Control, to appear in the 51st Annual Allerton Conference on Communication, Control, and Computing, pdf, posted here 3.9.2013. |
![]() | Komenda, J., Masopust, T., van Schuppen, J.H., Multilevel Coordination Control of Modular DES, to appear in the 52nd IEEE Conference on Decision and Control (CDC), pdf, posted here 3.9.2013. |