Descriptional Complexity of Generalized Forbidding Grammars. - Tomás Masopust; Alexander Meduna (DCFS, 2007)

A Note on the Descriptional Complexity of Semi-Conditional Grammars. - Tomás Masopust (Workshop on Formal Models, 2007)

Descriptional Complexity of Grammars Regulated by Context Conditions. - Tomás Masopust; Alexander Meduna (LATA, 2007)

Self-Regulating Finite Automata. - Alexander Meduna; Tomás Masopust (Acta Cybern., 2007)

Descriptional complexity of semi-conditional grammars. - Tomás Masopust; Alexander Meduna (Inf. Process. Lett., 2007)

Two Power-Decreasing Derivation Restrictions in Generalized Scattered Context Grammars. - Tomás Masopust; Alexander Meduna; Jirí Simácek (Acta Cybern., 2008)

Leftmost Derivations of Propagating Scattered Context Grammars: A New Proof. - Tomás Masopust; Jirí Techet (Discret. Math. Theor. Comput. Sci., 2008)

On Descriptional Complexity of Partially Parallel Grammars. - Tomás Masopust; Alexander Meduna (Fundam. Informaticae, 2008)

Descriptional complexity of multi-parallel grammars. - Tomás Masopust (Inf. Process. Lett., 2008)

A Note on the Cooperation in Rewriting Systems with Context-Dependency Checking. - Zbynek Krivka; Tomás Masopust (ICTCS, 2009)

A Note on the Generative Power of Some Simple Variants of Context-Free Grammars Regulated by Context Conditions. - Tomás Masopust (LATA, 2009)

Regulated Nondeterminism in PDAs: The Non-Regular Case. - Tomás Masopust (NCMA, 2009)

On Pure Multi-Pushdown Automata that Perform Complete Pushdown Pops. - Tomás Masopust; Alexander Meduna (Acta Cybern., 2009)

Answers to Questions Formulated in the Paper "On States Observability in Deterministic Finite Automata" - Tomás Masopust (CoRR, 2009)

Descriptional Complexity of Three-Nonterminal Scattered Context Grammars: An Improvement - Tomás Masopust; Alexander Meduna (DCFS, 2009)

On the Terminating Derivation Mode in Cooperating Distributed Grammar Systems with Forbidding Components. - Tomás Masopust (Int. J. Found. Comput. Sci., 2009)

On context-free rewriting with a simple restriction and its computational completeness. - Tomás Masopust; Alexander Meduna (RAIRO Theor. Informatics Appl., 2009)

On the descriptional complexity of scattered context grammars. - Tomás Masopust (Theor. Comput. Sci., 2009)

Blackhole State-Controlled Regulated Pushdown Automata. - Erzsébet Csuhaj-Varjú; Tomás Masopust; György Vaszil (NCMA, 2010)

Supremal normal sublanguages in hierarchical supervisory control. - Jan Komenda; Tomás Masopust (WODES, 2010)

Synthesis of safe sublanguages satisfying global specification using coordination scheme for discrete-event systems. - Jan Komenda; Tomás Masopust; Jan H. van Schuppen (WODES, 2010)

Comparison of Two Context-Free Rewriting Systems with Simple Context-Checking Mechanisms - Tomás Masopust (CoRR, 2010)

Bounded Number of Parallel Productions in Scattered Context Grammars with Three Nonterminals. - Tomás Masopust (Fundam. Informaticae, 2010)

Regulated Nondeterminism in Pushdown Automata: The Non-Regular Case. - Tomás Masopust (Fundam. Informaticae, 2010)

Simple restriction in context-free rewriting. - Tomás Masopust (J. Comput. Syst. Sci., 2010)

Left-forbidding cooperating distributed grammar systems. - Filip Goldefus; Tomás Masopust; Alexander Meduna (Theor. Comput. Sci., 2010)

Hierarchical control with partial observations: Sufficient conditions. - Olivier Boutin; Jan Komenda; Tomás Masopust; Klaus Schmidt 002; Jan H. van Schuppen (CDC/ECC, 2011)

State Complexity of Projected Languages. - Galina Jirásková; Tomás Masopust (DCFS, 2011)

Cooperating Distributed Grammar Systems with Random Context Grammars as Components. - Zbynek Krivka; Tomás Masopust (Acta Cybern., 2011)

Control of Distributed Systems: Tutorial and Overview. - Olivier Boutin; Jan Komenda; Tomás Masopust; Nicola Pambakian; Jan H. van Schuppen; Pia L. Kempker; André C. M. Ran (Eur. J. Control, 2011)

Blackhole Pushdown Automata. - Erzsébet Csuhaj-Varjú; Tomás Masopust; György Vaszil (Fundam. Informaticae, 2011)

Complexity in Union-Free Regular Languages. - Galina Jirásková; Tomás Masopust (Int. J. Found. Comput. Sci., 2011)

Synthesis of controllable and normal sublanguages for discrete-event systems using a coordinator. - Jan Komenda; Tomás Masopust; Jan H. van Schuppen (Syst. Control. Lett., 2011)

On Properties and State Complexity of Deterministic State-Partition Automata. - Galina Jirásková; Tomás Masopust (IFIP TCS, 2012)

On the State and Computational Complexity of the Reverse of Acyclic Minimal DFAs. - Galina Jirásková; Tomás Masopust (CIAA, 2012)

On algorithms and extensions of coordination control of discrete-event systems. - Jan Komenda; Tomás Masopust; Jan H. van Schuppen (WODES, 2012)

Supervisory control synthesis of discrete-event systems using a coordination scheme. - Jan Komenda; Tomás Masopust; Jan H. van Schuppen (Autom., 2012)

A note on controllability of deterministic context-free systems. - Tomás Masopust (Autom., 2012)

A Note on Undecidability of Observation Consistency for Non-Regular Languages - Tomás Masopust (CoRR, 2012)

On restricted context-free grammars. - Jürgen Dassow; Tomás Masopust (J. Comput. Syst. Sci., 2012)

On conditional decomposability. - Jan Komenda; Tomás Masopust; Jan H. van Schuppen (Syst. Control. Lett., 2012)

On a structural property in the state complexity of projected regular languages. - Galina Jirásková; Tomás Masopust (Theor. Comput. Sci., 2012)

Languages, Decidability, and Complexity. - Stefan Haar; Tomás Masopust (Control of Discrete-Event Systems, 2013)

Supervisory Control of Distributed Discrete-Event Systems. - Jan Komenda; Tomás Masopust; Jan H. van Schuppen (Control of Discrete-Event Systems, 2013)

Coordination Control of Distributed Discrete-Event Systems. - Jan Komenda; Tomás Masopust; Jan H. van Schuppen (Control of Discrete-Event Systems, 2013)

Supervisory Control with Complete Observations. - Tomás Masopust; Jan H. van Schuppen (Control of Discrete-Event Systems, 2013)

A bridge between decentralized and coordination control. - Jan Komenda; Tomás Masopust (Allerton, 2013)

Multilevel coordination control of modular DES. - Jan Komenda; Tomás Masopust; Jan H. van Schuppen (CDC, 2013)

On the State Complexity of the Reverse of - and -Trivial Regular Languages. - Galina Jirásková; Tomás Masopust (DCFS, 2013)

Efficient Separability of Regular Languages by Subsequences and Suffixes. - Wojciech Czerwinski; Wim Martens; Tomás Masopust (ICALP (2), 2013)

On the State Complexity of the Reverse of R- and J-trivial Regular Languages - Galina Jirásková; Tomás Masopust (CoRR, 2013)

A Note on Limited Pushdown Alphabets in Stateless Deterministic Pushdown Automata. - Tomás Masopust (Int. J. Found. Comput. Sci., 2013)

Decentralized supervisory control with communicating supervisors based on top-down coordination control. - Jan Komenda; Tomás Masopust (CDC, 2014)

Bottom-up approach to multilevel supervisory control with coordination. - Jan Komenda; Tomás Masopust; Jan H. van Schuppen (ECC, 2014)

On Upper and Lower Bounds on the Length of Alternating Towers. - Stepan Holub; Galina Jirásková; Tomás Masopust (MFCS (1), 2014)

Alternating Towers and Piecewise Testable Separators. - Stepan Holub; Tomás Masopust; Michaël Thomazo (CoRR, 2014)

On Upper and Lower Bounds on the Length of Alternating Towers. - Galina Jirásková; Tomás Masopust (CoRR, 2014)

Maximally Permissive Coordination Supervisory Control - Towards Necessary and Sufficient Conditions. - Jan Komenda; Tomás Masopust; Jan H. van Schuppen (CoRR, 2014)

A Note on Relative Observability in Coordination Control. - Jan Komenda; Tomás Masopust; Jan H. van Schuppen (CoRR, 2014)

On $k$-piecewise testability (preliminary report). - Tomás Masopust; Michaël Thomazo (CoRR, 2014)

Multilevel coordination control of partially observed modular DES. - Jan Komenda; Tomás Masopust; Jan H. van Schuppen (ACC, 2015)

Relative observability in coordination control. - Jan Komenda; Tomás Masopust; Jan H. van Schuppen (CASE, 2015)

On the Complexity of k-Piecewise Testability and the Depth of Automata. - Tomás Masopust; Michaël Thomazo (DLT, 2015)

On the Computation of Controllable and Coobservable Sublanguages in Decentralized Supervisory Control. - Jan Komenda; Tomás Masopust (CoRR, 2015)

Coordination control of discrete-event systems revisited. - Jan Komenda; Tomás Masopust; Jan H. van Schuppen (Discret. Event Dyn. Syst., 2015)

Distributed computation of maximally permissive supervisors in three-level relaxed coordination control of discrete-event systems. - Jan Komenda; Tomás Masopust; Jan H. van Schuppen (CDC, 2016)

On the Complexity of Universality for Partially Ordered NFAs. - Markus Krötzsch; Tomás Masopust; Michaël Thomazo (MFCS, 2016)

Piecewise Testable Languages and Nondeterministic Automata. - Tomás Masopust (MFCS, 2016)

Control of an engineering-structured multilevel discrete-event system. - Jan Komenda; Tomás Masopust; Jan H. van Schuppen (WODES, 2016)

On a Distributed Computation of Supervisors in Modular Supervisory Control. - Jan Komenda; Tomás Masopust; Jan H. van Schuppen (CoRR, 2016)

Distributed computation of supremal conditionally controllable sublanguages. - Jan Komenda; Tomás Masopust (Int. J. Control, 2016)

Universality of Confluent, Self-Loop Deterministic Partially Ordered NFAs is Hard. - Tomás Masopust; Markus Krötzsch (CoRR, 2017)

Computation of controllable and coobservable sublanguages in decentralized supervisory control via communication. - Jan Komenda; Tomás Masopust (Discret. Event Dyn. Syst., 2017)

Complexity of universality and related problems for partially ordered NFAs. - Markus Krötzsch; Tomás Masopust; Michaël Thomazo (Inf. Comput., 2017)

On Boolean combinations forming piecewise testable languages. - Tomás Masopust; Michaël Thomazo (Theor. Comput. Sci., 2017)

Deciding Universality of ptNFAs is PSpace-Complete. - Tomás Masopust; Markus Krötzsch (SOFSEM, 2018)

Complexity of deciding detectability in discrete event systems. - Tomás Masopust (Autom., 2018)

Deciding Detectability for Labeled Petri Nets. - Tomás Masopust; Xiang Yin 003 (CoRR, 2018)

Complexity of Infimal Observable Superlanguages. - Tomás Masopust (IEEE Trans. Autom. Control., 2018)

Complexity of Verifying Nonblockingness in Modular Supervisory Control. - Tomás Masopust (IEEE Trans. Autom. Control., 2018)

Separability by piecewise testable languages is PTime-complete. - Tomás Masopust (Theor. Comput. Sci., 2018)

Some new results on the state liveness of open guidepath-based traffic systems. - Spyros A. Reveliotis; Tomás Masopust (MED, 2019)

Complexity of detectability, opacity and A-diagnosability for modular discrete event systems. - Tomás Masopust; Xiang Yin 003 (Autom., 2019)

Conditions for Hierarchical Supervisory Control under Partial Observation. - Jan Komenda; Tomás Masopust (CoRR, 2019)

On Verification of Strong Periodic D-Detectability for Discrete Event Systems. - Jirí Balun; Tomás Masopust (CoRR, 2019)

On Opacity Verification for Discrete-Event Systems. - Jirí Balun; Tomás Masopust (CoRR, 2019)

On the height of towers of subsequences and prefixes. - Stepan Holub; Tomás Masopust; Michaël Thomazo (Inf. Comput., 2019)

Automatic Generation of Optimal Reductions of Distributions. - Liyong Lin; Tomás Masopust; Walter Murray Wonham; Rong Su 001 (IEEE Trans. Autom. Control., 2019)

Critical Observability for Automata and Petri Nets. - Tomás Masopust (IEEE Trans. Autom. Control., 2020)

Efficient Liveness Assessment for Traffic States in Open, Irreversible, Dynamically Routed, Zone-Controlled Guidepath-Based Transport Systems. - Spyros A. Reveliotis; Tomás Masopust (IEEE Trans. Autom. Control., 2020)

On verification of D-detectability for discrete event systems. - Jirí Balun; Tomás Masopust (Autom., 2021)

Comparing the Notions of Opacity for Discete-Event Systems. - Jirí Balun; Tomás Masopust (CoRR, 2021)

K-Step Opacity in Discrete Event Systems: Verification, Complexity, and Relations. - Jirí Balun; Tomás Masopust (CoRR, 2021)

Comparing the notions of opacity for discrete-event systems. - Jirí Balun; Tomás Masopust (Discret. Event Dyn. Syst., 2021)

Partially Ordered Automata and Piecewise Testability. - Tomás Masopust; Markus Krötzsch (Log. Methods Comput. Sci., 2021)

On Transformations among Opacity Notions. - Jirí Balun; Tomás Masopust (SMC, 2022)

Modular control of discrete-event systems using similarity. - Yingying Liu; Jan Komenda; Tomás Masopust; Zhiwu Li 001 (Autom., 2022)

Hierarchical and Modular Supervisory Control under Partial Observation: Normality. - Jan Komenda; Tomás Masopust (CoRR, 2022)

Speed Me up If You Can: Conditional Lower Bounds on Opacity Verification. - Jirí Balun; Tomás Masopust; Petr Osicka (MFCS, 2023)

Verifying weak and strong k-step opacity in discrete-event systems. - Jirí Balun; Tomás Masopust (Autom., 2023)

Hierarchical Supervisory Control Under Partial Observation: Normality. - Jan Komenda; Tomás Masopust (IEEE Trans. Autom. Control., 2023)

On the Complexity of Initial-and-Final-State Opacity for Discrete Event Systems. - Tomás Masopust; Petr Osicka (CoRR, 2024)

Supervisory Control of Modular Discrete-Event Systems Under Partial Observation: Normality. - Jan Komenda; Tomás Masopust (IEEE Trans. Autom. Control., 2024)

On algorithms verifying initial-and-final-state opacity: Complexity, special cases, and comparison. - Tomás Masopust; Petr Osicka (Autom., 2025)