T
Tomáš Masopust
Researcher at Palacký University, Olomouc
Publications - 137
Citations - 1246
Tomáš Masopust is an academic researcher from Palacký University, Olomouc. The author has contributed to research in topics: Supervisory control & Context-sensitive grammar. The author has an hindex of 17, co-authored 129 publications receiving 1090 citations. Previous affiliations of Tomáš Masopust include Brno University of Technology & Hungarian Academy of Sciences.
Papers
More filters
Journal ArticleDOI
Leftmost Derivations of Propagating Scattered Context Grammars: A New Proof
Tomáš Masopust,Jiri Techet +1 more
TL;DR: A significantly simplified proof of V. Virkkunen's result that propagating scattered context grammars which use leftmost derivations are as powerful as context-sensitive Grammars is brought.
Journal ArticleDOI
Coordinated Control of Discrete Event Systems with Nonprefix-Closed Languages
TL;DR: In this paper, the coordination-control architecture proposed by Komenda and van Schuppen (2008) and studied for prefix-closed specification languages was generalized to the case of nonprefix-closed global specification languages and non-prefix closed plant languages.
Journal ArticleDOI
Critical Observability for Automata and Petri Nets
TL;DR: This work studies the computational complexity of deciding critical observability for systems modeled as (networks of) finite-state automata and Petri nets and shows that decidingcritical observability is very unlikely solvable in polynomial time and undecidable for labeled Petrinets.
Journal ArticleDOI
Descriptional complexity of semi-conditional grammars
Tomáš Masopust,Alexander Meduna +1 more
TL;DR: It is proved that every recursively enumerable language is generated by a semi-conditional grammar of degree (2,1) with no more than seven conditional productions and eight nonterminals.
Book ChapterDOI
State complexity of projected languages
Galina Jirásková,Tomáš Masopust +1 more
TL;DR: It is shown that the known upper bound is reachable only by automata with one unobservable transition, that is, a transition labeled with a symbol removed by the projection, and improved by considering the structure of the automaton.