Tomas Masopust
Tomas Masopust
Dept of Computer Science, Palacky University & Institut of Mathematics CAS
Dirección de correo verificada de - Página principal
Citado por
Citado por
Efficient separability of regular languages by subsequences and suffixes
W Czerwiński, W Martens, T Masopust
International Colloquium on Automata, Languages, and Programming, 150-161, 2013
Control of distributed systems: Tutorial and overview
JH van Schuppen, O Boutin, PL Kempker, J Komenda, T Masopust, ...
European journal of control 17 (5), 579, 2011
Supervisory control synthesis of discrete-event systems using a coordination scheme
J Komenda, T Masopust, JH Van Schuppen
Automatica 48 (2), 247-254, 2012
Coordination control of discrete-event systems revisited
J Komenda, T Masopust, JH van Schuppen
Discrete Event Dynamic Systems 25 (1-2), 65-94, 2015
On Conditional Decomposability
J Komenda, T Masopust, JH van Schuppen
Systems & Control Letters 61 (12), 1260-1268, 2012
Synthesis of controllable and normal sublanguages for discrete-event systems using a coordinator
J Komenda, T Masopust, JH Van Schuppen
Systems & Control Letters 60 (7), 492-502, 2011
Complexity of deciding detectability in discrete event systems
T Masopust
Automatica 93, 257-261, 2018
Complexity in union-free regular languages
G Jirásková, T Masopust
International Journal of Foundations of Computer Science 22 (07), 1639-1653, 2011
Synthesis of safe sublanguages satisfying global specification using coordination scheme for discrete-event systems
J Komenda, T Masopust, JH van Schuppen
Workshop on Discrete-Event Systems 10 (1), 426-431, 2010
Complexity in union-free regular languages
G Jirásková, T Masopust
International Conference on Developments in Language Theory, 255-266, 2010
Complexity of detectability, opacity and A-diagnosability for modular discrete event systems
T Masopust, X Yin
Automatica 101, 290-295, 2019
Deciding detectability for labeled Petri nets
T Masopust, X Yin
Automatica 104, 238-241, 2019
Multilevel coordination control of modular DES
J Komenda, T Masopust, JH van Schuppen
52nd IEEE Conference on Decision and Control, 6323-6328, 2013
Cooperating distributed grammar systems with permitting grammars as components
E Csuhaj-Varjú, T Masopust, G Vaszil
Romanian Journal of Information Science and Technology 12 (2), 175-189, 2009
On a structural property in the state complexity of projected regular languages
G Jirásková, T Masopust
Theoretical Computer Science 449, 93-105, 2012
Left-forbidding cooperating distributed grammar systems
F Goldefus, T Masopust, A Meduna
Theoretical Computer Science 411 (40-42), 3661-3667, 2010
Formal Models: Regulation and Reduction
T Masopust
Faculty of Information Technology BUT, 2007
Piecewise Testable Languages and Nondeterministic Automata
T Masopust
MFCS 2016 58, 67:1-67:14, 2016
Simple restriction in context-free rewriting
T Masopust
Journal of Computer and System Sciences 76 (8), 837-846, 2010
Descriptional Complexity of Grammars Regulated by Context Conditions
T Masopust, A Meduna
LATA 2007 Pre-proceedings, 403-411, 2007
El sistema no puede realizar la operación en estos momentos. Inténtalo de nuevo más tarde.
Artículos 1–20