Tomás Masopust

	2012
37		Jan Komenda, Tomás Masopust, Jan H. van Schuppen: Supervisory control synthesis of discrete-event systems using a coordination scheme. Automatica 48(2): 247-254 (2012)
36		Jan Komenda, Tomás Masopust, Jan H. van Schuppen: On Conditional Decomposability CoRR abs/1201.1733: (2012)
35		Tomás Masopust: A Note on Undecidability of Observation Consistency for Non-Regular Languages CoRR abs/1201.1754: (2012)
34		Jürgen Dassow, Tomás Masopust: On restricted context-free grammars. J. Comput. Syst. Sci. 78(1): 293-304 (2012)
	2011
33		Olivier Boutin, Jan Komenda, Tomás Masopust, Klaus Schmidt, Jan H. van Schuppen: Hierarchical control with partial observations: Sufficient conditions. CDC-ECE 2011: 1817-1822
32		Galina Jirásková, Tomás Masopust: State Complexity of Projected Languages. DCFS 2011: 198-211
31		Erzsébet Csuhaj-Varjú, Tomás Masopust, György Vaszil: Blackhole Pushdown Automata. Fundam. Inform. 112(2-3): 137-156 (2011)
30		Galina Jirásková, Tomás Masopust: Complexity in Union-Free Regular Languages. Int. J. Found. Comput. Sci. 22(7): 1639-1653 (2011)
29		Jan Komenda, Tomás Masopust, Jan H. van Schuppen: Synthesis of controllable and normal sublanguages for discrete-event systems using a coordinator. Systems & Control Letters 60(7): 492-502 (2011)
	2010
28		Galina Jirásková, Tomás Masopust: Complexity in Union-Free Regular Languages. Developments in Language Theory 2010: 255-266
27		Jürgen Dassow, Tomás Masopust: On Restricted Context-Free Grammars. Developments in Language Theory 2010: 434-435
26		Erzsébet Csuhaj-Varjú, Tomás Masopust, György Vaszil: Blackhole State-Controlled Regulated Pushdown Automata. NCMA 2010: 45-56
25		Tomás Masopust: Comparison of Two Context-Free Rewriting Systems with Simple Context-Checking Mechanisms CoRR abs/1004.3635: (2010)
24		Jan Komenda, Tomás Masopust, Jan H. van Schuppen: Supervisory Control Synthesis of Discrete-Event Systems using Coordination Scheme CoRR abs/1007.2707: (2010)
23		Tomás Masopust: Regulated Nondeterminism in Pushdown Automata: The Non-Regular Case. Fundam. Inform. 104(1-2): 111-124 (2010)
22		Tomás Masopust: Bounded Number of Parallel Productions in Scattered Context Grammars with Three Nonterminals. Fundam. Inform. 99(4): 473-480 (2010)
21		Tomás Masopust: Simple restriction in context-free rewriting. J. Comput. Syst. Sci. 76(8): 837-846 (2010)
20		Filip Goldefus, Tomás Masopust, Alexander Meduna: Left-forbidding cooperating distributed grammar systems. Theor. Comput. Sci. 411(40-42): 3661-3667 (2010)
	2009
19		Tomás Masopust, Alexander Meduna: Descriptional Complexity of Three-Nonterminal Scattered Context Grammars: An Improvement DCFS 2009: 183-192
18		Zbynek Krivka, Tomás Masopust: A Note on the Cooperation in Rewriting Systems with Context-Dependency Checking. ICTCS 2009: 129-135
17		Tomás Masopust: A Note on the Generative Power of Some Simple Variants of Context-Free Grammars Regulated by Context Conditions. LATA 2009: 554-565
16		Tomás Masopust: Regulated Nondeterminism in PDAs: The Non-Regular Case. NCMA 2009: 181-194
15		Tomás Masopust, Alexander Meduna: On Pure Multi-Pushdown Automata that Perform Complete Pushdown Pops. Acta Cybern. 19(2): 537-552 (2009)
14		Tomás Masopust: Answers to Questions Formulated in the Paper "On States Observability in Deterministic Finite Automata" CoRR abs/0905.4193: (2009)
13		Tomás Masopust, Alexander Meduna: On context-free rewriting with a simple restriction and its computational completeness. ITA 43(2): 365-378 (2009)
12		Tomás Masopust: On the Terminating Derivation Mode in Cooperating Distributed Grammar Systems with Forbidding Components. Int. J. Found. Comput. Sci. 20(2): 331-340 (2009)
11		Tomás Masopust: On the descriptional complexity of scattered context grammars. Theor. Comput. Sci. 410(1): 108-112 (2009)
	2008
10		Tomás Masopust, Alexander Meduna: On Pure Multi-Pushdown Automata that Perform Complete-Pushdown Pops. AFL 2008: 325-336
9		Tomás Masopust, Alexander Meduna, Jirí Simácek: Two Power-Decreasing Derivation Restrictions in Generalized Scattered Context Grammars. Acta Cybern. 18(4): 783-793 (2008)
8		Tomás Masopust, Jirí Techet: Leftmost Derivations of Propagating Scattered Context Grammars: A New Proof. Discrete Mathematics & Theoretical Computer Science 10(2): (2008)
7		Tomás Masopust, Alexander Meduna: On Descriptional Complexity of Partially Parallel Grammars. Fundam. Inform. 87(3-4): 407-415 (2008)
6		Tomás Masopust: Descriptional complexity of multi-parallel grammars. Inf. Process. Lett. 108(2): 68-70 (2008)
	2007
5		Tomás Masopust, Alexander Meduna: Descriptional Complexity of Generalized Forbidding Grammars. DCFS 2007: 170-177
4		Tomás Masopust, Alexander Meduna: Descriptional Complexity of Grammars Regulated by Context Conditions. LATA 2007: 403-412
3		Tomás Masopust: A Note on the Descriptional Complexity of Semi-Conditional Grammars. Workshop on Formal Models 2007
2		Alexander Meduna, Tomás Masopust: Self-Regulating Finite Automata. Acta Cybern. 18(1): 135-153 (2007)
1		Tomás Masopust, Alexander Meduna: Descriptional complexity of semi-conditional grammars. Inf. Process. Lett. 104(1): 29-31 (2007)

Coauthor Index

1	Olivier Boutin	[33]
2	Erzsébet Csuhaj-Varjú	[26] [31]
3	Jürgen Dassow	[27] [34]
4	Filip Goldefus	[20]
5	Galina Jirásková (Galina Kumicáková-Jirásková)	[28] [30] [32]
6	Jan Komenda	[24] [29] [33] [36] [37]
7	Zbynek Krivka	[18]
8	Alexander Meduna	[1] [2] [4] [5] [7] [9] [10] [13] [15] [19] [20]
9	Klaus Schmidt	[33]
10	Jan H. van Schuppen	[24] [29] [33] [36] [37]
11	Jirí Simácek	[9]
12	Jirí Techet	[8]
13	György Vaszil	[26] [31]

Colors in the list of coauthors

Last update Fri May 25 01:42:58 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page