The following pages link to Tomáš Masopust (Q414884):
Displaying 50 items.
- On restricted context-free grammars (Q414885) (← links)
- On a structural property in the state complexity of projected regular languages (Q443744) (← links)
- Synthesis of controllable and normal sublanguages for discrete-event systems using a coordinator (Q553375) (← links)
- Control of distributed systems: tutorial and overview (Q693692) (← links)
- Left-forbidding cooperating distributed grammar systems (Q708220) (← links)
- Descriptional complexity of multi-parallel grammars (Q975402) (← links)
- On the descriptional complexity of scattered context grammars (Q1001907) (← links)
- Computation of controllable and coobservable sublanguages in decentralized supervisory control via communication (Q1686848) (← links)
- Separability by piecewise testable languages is \textsc{PTime}-complete (Q1698734) (← links)
- Complexity of detectability, opacity and A-diagnosability for modular discrete event systems (Q1737732) (← links)
- Deciding detectability for labeled Petri nets (Q1737932) (← links)
- Complexity of deciding detectability in discrete event systems (Q1797011) (← links)
- On conditional decomposability (Q1932746) (← links)
- Supervisory control synthesis of discrete-event systems using a coordination scheme (Q1941245) (← links)
- Simple restriction in context-free rewriting (Q1959430) (← links)
- Complexity of universality and related problems for partially ordered NFAs (Q2013561) (← links)
- Comparing the notions of opacity for discrete-event systems (Q2063098) (← links)
- On verification of D-detectability for discrete event systems (Q2065231) (← links)
- Modular control of discrete-event systems using similarity (Q2151956) (← links)
- On the height of towers of subsequences and prefixes (Q2272979) (← links)
- Coordination control of discrete-event systems revisited (Q2348358) (← links)
- On Boolean combinations forming piecewise testable languages (Q2358689) (← links)
- Descriptional complexity of semi-conditional grammars (Q2379990) (← links)
- A note on controllability of deterministic context-free~systems (Q2391510) (← links)
- Polynomial-time optimal liveness enforcement for guidepath-based transport systems (Q2665316) (← links)
- Distributed computation of supremal conditionally controllable sublanguages (Q2792732) (← links)
- On the State Complexity of the Reverse of ${\mathcal R}$ - and ${\mathcal J}$ -Trivial Regular Languages (Q2843091) (← links)
- A note on limited pushdown alphabets in stateless deterministic pushdown automata (Q2856007) (← links)
- Blackhole pushdown automata (Q2882387) (← links)
- Complexity in union-free regular languages (Q2909101) (← links)
- On the State and Computational Complexity of the Reverse of Acyclic Minimal DFAs (Q2914712) (← links)
- On Properties and State Complexity of Deterministic State-Partition Automata (Q2915168) (← links)
- Cooperating distributed grammar systems with random context grammars as components (Q2915547) (← links)
- On Upper and Lower Bounds on the Length of Alternating Towers (Q2922026) (← links)
- Regulated Nondeterminism in Pushdown Automata: The Non-Regular Case (Q3000293) (← links)
- Some Power-Decreasing Derivation Restrictions in Grammar Systems (Q3113295) (← links)
- On the Complexity of k-Piecewise Testability and the Depth of Automata (Q3451116) (← links)
- Complexity in Union-Free Regular Languages (Q3584898) (← links)
- On Restricted Context-Free Grammars (Q3584913) (← links)
- (Q3601874) (← links)
- (Q3615307) (← links)
- A Note on the Generative Power of Some Simple Variants of Context-Free Grammars Regulated by Context Conditions (Q3618613) (← links)
- On context-free rewriting with a simple restriction and its computational completeness (Q3625698) (← links)
- ON THE TERMINATING DERIVATION MODE IN COOPERATING DISTRIBUTED GRAMMAR SYSTEMS WITH FORBIDDING COMPONENTS (Q3634185) (← links)
- Supervisory Control of Discrete-Event Systems (Q4560599) (← links)
- Coordination Control of Distributed Discrete-Event Systems (Q4560600) (← links)
- Complexity of Infimal Observable Superlanguages (Q4567064) (← links)
- Complexity of Verifying Nonblockingness in Modular Supervisory Control (Q4567109) (← links)
- (Q4608624) (← links)
- Piecewise testable languages and nondeterministic automata (Q4608630) (← links)
