pith. sign in

Tom\'a\v{s} Masopust

Identifiers

  • name variant Tom\'a\v{s} Masopust 0.60 · backfill

Papers (27)

  1. Critical Observability for Automata and Petri Nets cs.SY · 2018 · author #1
  2. Automatic Generation of Optimal Reductions of Distributions cs.SY · 2018 · author #2
  3. Complexity of Detectability, Opacity and A-Diagnosability for Modular Discrete Event Systems cs.SY · 2017 · author #1
  4. Complexity of Deciding Detectability in Discrete Event Systems cs.SY · 2017 · author #1
  5. Universality of Confluent, Self-Loop Deterministic Partially Ordered NFAs is Hard cs.FL · 2017 · author #1
  6. Separability by Piecewise Testable Languages is PTime-Complete cs.FL · 2017 · author #1
  7. Complexity of Infimal Observable Superlanguages cs.SY · 2017 · author #1
  8. Complexity of Verifying Nonblockingness in Modular Supervisory Control cs.SY · 2017 · author #1
  9. Complexity of Universality and Related Problems for Partially Ordered NFAs cs.FL · 2016 · author #2
  10. On a Distributed Computation of Supervisors in Modular Supervisory Control math.OC · 2016 · author #2
  11. Piecewise Testable Languages and Nondeterministic Automata cs.FL · 2016 · author #1
  12. Computation of Controllable and Coobservable Sublanguages in Decentralized Supervisory Control via Communication math.OC · 2015 · author #2
  13. Combined Top-down and Bottom-up Approach to Multilevel Supervisory Control math.OC · 2015 · author #2
  14. A Relaxed Framework for Coordination Control of Discrete-Event Systems math.OC · 2015 · author #2
  15. On $k$-piecewise testability (preliminary report) cs.FL · 2014 · author #1
  16. Alternating Towers and Piecewise Testable Separators cs.FL · 2014 · author #2
  17. On Upper and Lower Bounds on the Length of Alternating Towers cs.FL · 2014 · author #3
  18. A Note on Relative Observability in Coordination Control math.OC · 2014 · author #2
  19. Decentralized Supervisory Control with Communicating Supervisors Based on Top-Down Coordination Control math.OC · 2014 · author #2
  20. Maximally Permissive Coordination Supervisory Control -- Towards Necessary and Sufficient Conditions math.OC · 2014 · author #2
  21. On the State Complexity of the Reverse of R- and J-trivial Regular Languages cs.FL · 2013 · author #2
  22. Efficient Separability of Regular Languages by Subsequences and Suffixes cs.FL · 2013 · author #3
  23. A Note on Limited Pushdown Alphabets in Stateless Deterministic Pushdown Automata cs.FL · 2012 · author #1
  24. On Algorithms and Extensions of Coordination Control of Discrete-Event Systems math.OC · 2012 · author #2
  25. A Note on Undecidability of Observation Consistency for Non-Regular Languages cs.SY · 2012 · author #1
  26. On Conditional Decomposability cs.SY · 2012 · author #2
  27. Descriptional Complexity of Three-Nonterminal Scattered Context Grammars: An Improvement cs.FL · 2009 · author #1

Mentions

  • 1303.0966 #3 · backfill · confidence 0.70 Tom\'a\v{s} Masopust
  • 1208.5002 #1 · backfill · confidence 0.70 Tom\'a\v{s} Masopust
  • 1207.6200 #2 · backfill · confidence 0.70 Tom\'a\v{s} Masopust
  • 1201.1754 #1 · backfill · confidence 0.70 Tom\'a\v{s} Masopust
  • 1201.1733 #2 · backfill · confidence 0.70 Tom\'a\v{s} Masopust
  • 0907.5132 #1 · backfill · confidence 0.70 Tom\'a\v{s} Masopust

Frequent Coauthors