Tomás Masopust

	2009
13		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
12		Tomás Masopust: Answers to Questions Formulated in the Paper "On States Observability in Deterministic Finite Automata" CoRR abs/0905.4193: (2009)
11		Tomás Masopust, Alexander Meduna: Descriptional Complexity of Three-Nonterminal Scattered Context Grammars: An Improvement CoRR abs/0907.5132: (2009)
10		Tomás Masopust, Alexander Meduna: On context-free rewriting with a simple restriction and its computational completeness. ITA 43(2): 365-378 (2009)
9		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)
8		Tomás Masopust: On the descriptional complexity of scattered context grammars. Theor. Comput. Sci. 410(1): 108-112 (2009)
	2008
7		Tomás Masopust, Alexander Meduna, Jiri Simácek: Two Power-Decreasing Derivation Restrictions in Generalized Scattered Context Grammars. Acta Cybern. 18(4): 783-793 (2008)
6		Tomás Masopust, Jirí Techet: Leftmost Derivations of Propagating Scattered Context Grammars: A New Proof. Discrete Mathematics & Theoretical Computer Science 10(2): (2008)
5		Tomás Masopust, Alexander Meduna: On Descriptional Complexity of Partially Parallel Grammars. Fundam. Inform. 87(3-4): 407-415 (2008)
4		Tomás Masopust: Descriptional complexity of multi-parallel grammars. Inf. Process. Lett. 108(2): 68-70 (2008)
	2007
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	Alexander Meduna	[1] [2] [5] [7] [10] [11]
2	Jiri Simácek	[7]
3	Jirí Techet	[6]