scispace - formally typeset
Search or ask a question
Author

Tomáš Masopust

Bio: 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
TL;DR: Coordinated distributed systems are defined for linear systems, for Gaussian systems, and for discrete-eventsystemsandanalgebraic-geometriccharacterization and a specific control synthesis procedure is presented.

67 citations

Book ChapterDOI
08 Jul 2013
TL;DR: In this paper, the authors investigate the problem of separating two regular word languages by a simple language and give characterizations of when two languages can be separated and present an overview of when these problems can be decided in polynomial time if K and L are given by non-deterministic automata.
Abstract: When can two regular word languages K and L be separated by a simple language? We investigate this question and consider separation by piecewise- and suffix-testable languages and variants thereof. We give characterizations of when two languages can be separated and present an overview of when these problems can be decided in polynomial time if K and L are given by nondeterministic automata.

62 citations

Journal ArticleDOI
TL;DR: A procedure to compute the least restrictive solution within the coordination control architecture is provided and conditions under which the result coincides with the supremal controllable sublanguage are stated.

52 citations

Journal Article
TL;DR: In this article, a control synthesis problem for a generator with a global specification and with a combination of a coordinator and local controllers is formulated and solved, and conditions under which the result coincides with the supremal controllable sublanguage are stated.
Abstract: Supervisory control of distributed DES with a global specification and local supervisors is a difficult problem. For global specifications, the equivalent conditions for local control synthesis to equal global control synthesis may not be met. This paper formulates and solves a control synthesis problem for a generator with a global specification and with a combination of a coordinator and local controllers. Conditional controllability is proven to be an equivalent condition for the existence of such a coordinated controller. A procedure to compute the least restrictive solution within our coordination control architecture is provided and conditions under which the result coincides with the supremal controllable sublanguage are stated.

50 citations

Journal ArticleDOI
TL;DR: It is shown that it is not the case by considering DESs represented as deterministic finite automata without non-trivial cycles, which are structurally the simplest deadlock-freeDESs, that even for such very simple DESs, checking weak (periodic) detectability remains intractable.

48 citations


Cited by
More filters
01 Jan 2016
TL;DR: In this paper, a guide to the theory of np completeness is given for downloading computers and intractability a guide for reading good books with a cup of tea in the afternoon, instead they juggled with some harmful bugs inside their desktop computer.
Abstract: Thank you for downloading computers and intractability a guide to the theory of np completeness. As you may know, people have search numerous times for their favorite books like this computers and intractability a guide to the theory of np completeness, but end up in harmful downloads. Rather than reading a good book with a cup of tea in the afternoon, instead they juggled with some harmful bugs inside their desktop computer.

286 citations

Book
01 Jan 2003
TL;DR: This book develops the mathematical foundations of present day linguistics from a mathematical point of view starting with ideas already contained in Montague's work and equips the reader with all the background necessary to understand and evaluate theories as diverse as Montague Grammar, Categorial grammar, HPSG and GB.
Abstract: This book studies language(s) and linguistic theories from a mathematical point of view. Starting with ideas already contained in Montague's work, it develops the mathematical foundations of present day linguistics. It equips the reader with all the background necessary to understand and evaluate theories as diverse as Montague Grammar, Categorial Grammar, HPSG and GB. The mathematical tools are mainly from universal algebra and logic, but no particular knowledge is presupposed beyond a certain mathematical sophistication that is in any case needed in order to fruitfully work within these theories. The presentation focuses on abstract mathematical structures and their computational properties, but plenty of examples from different natural languages are provided to illustrate the main concepts and results. In contrast to books devoted to so-called formal language theory, languages are seen here as semiotic systems, that is, as systems of signs. A language sign correlates form with meaning. Using the principle of compositionality it is possible to gain substantial insight into the interaction between form and meaning in natural languages.

187 citations

Journal ArticleDOI
TL;DR: This paper first addresses the initial-state estimation problem in a non-deterministic finite automaton via the construction of an initial- state estimator, and shows how the complexity of the verification method can be greatly reduced in the special case when the set of secret states is invariant.

143 citations

Journal ArticleDOI
01 Jul 1982

141 citations