| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Jan Komenda, Tomás Masopust, Jan H. van Schuppen |
Supervisory control synthesis of discrete-event systems using a coordination scheme.  |
Automatica  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Tomás Masopust |
A Note on Undecidability of Observation Consistency for Non-Regular Languages |
CoRR |
2012 |
DBLP BibTeX RDF |
|
| 1 | Jan Komenda, Tomás Masopust, Jan H. van Schuppen |
On Conditional Decomposability |
CoRR |
2012 |
DBLP BibTeX RDF |
|
| 1 | Jürgen Dassow, Tomás Masopust |
On restricted context-free grammars. |
J. Comput. Syst. Sci. |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Galina Jirásková, Tomás Masopust |
Complexity in Union-Free Regular Languages. |
Int. J. Found. Comput. Sci. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Erzsébet Csuhaj-Varjú, Tomás Masopust, György Vaszil |
Blackhole Pushdown Automata. |
Fundam. Inform. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Olivier Boutin, Jan Komenda, Tomás Masopust, Klaus Schmidt, Jan H. van Schuppen |
Hierarchical control with partial observations: Sufficient conditions. |
CDC-ECE |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Galina Jirásková, Tomás Masopust |
State Complexity of Projected Languages. |
DCFS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Filip Goldefus, Tomás Masopust, Alexander Meduna |
Left-forbidding cooperating distributed grammar systems. |
Theor. Comput. Sci. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Tomás Masopust |
Regulated Nondeterminism in Pushdown Automata: The Non-Regular Case. |
Fundam. Inform. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Tomás Masopust |
Bounded Number of Parallel Productions in Scattered Context Grammars with Three Nonterminals. |
Fundam. Inform. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Jan Komenda, Tomás Masopust, Jan H. van Schuppen |
Supervisory Control Synthesis of Discrete-Event Systems using Coordination Scheme |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Tomás Masopust |
Comparison of Two Context-Free Rewriting Systems with Simple Context-Checking Mechanisms |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Tomás Masopust |
Simple restriction in context-free rewriting. |
J. Comput. Syst. Sci. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Jürgen Dassow, Tomás Masopust |
On Restricted Context-Free Grammars. |
Developments in Language Theory |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Galina Jirásková, Tomás Masopust |
Complexity in Union-Free Regular Languages. |
Developments in Language Theory |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Erzsébet Csuhaj-Varjú, Tomás Masopust, György Vaszil |
Blackhole State-Controlled Regulated Pushdown Automata. |
NCMA |
2010 |
DBLP BibTeX RDF |
|
| 1 | Tomás Masopust, Alexander Meduna |
On Pure Multi-Pushdown Automata that Perform Complete Pushdown Pops. |
Acta Cybern. |
2009 |
DBLP BibTeX RDF |
|
| 1 | Tomás Masopust |
On the descriptional complexity of scattered context grammars. |
Theor. Comput. Sci. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Tomás Masopust, Alexander Meduna |
On context-free rewriting with a simple restriction and its computational completeness. |
ITA |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Tomás Masopust |
On the Terminating Derivation Mode in Cooperating Distributed Grammar Systems with Forbidding Components. |
Int. J. Found. Comput. Sci. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Tomás Masopust |
Answers to Questions Formulated in the Paper "On States Observability in Deterministic Finite Automata" |
CoRR |
2009 |
DBLP BibTeX RDF |
|
| 1 | Tomás Masopust, Alexander Meduna |
Descriptional Complexity of Three-Nonterminal Scattered Context Grammars: An Improvement |
DCFS |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Zbynek Krivka, Tomás Masopust |
A Note on the Cooperation in Rewriting Systems with Context-Dependency Checking. |
ICTCS |
2009 |
DBLP BibTeX RDF |
|
| 1 | Tomás Masopust |
A Note on the Generative Power of Some Simple Variants of Context-Free Grammars Regulated by Context Conditions. |
LATA |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Tomás Masopust |
Regulated Nondeterminism in PDAs: The Non-Regular Case. |
NCMA |
2009 |
DBLP BibTeX RDF |
|
| 1 | Tomás Masopust |
Descriptional complexity of multi-parallel grammars. |
Inf. Process. Lett. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Tomás Masopust, Alexander Meduna, Jirí Simácek |
Two Power-Decreasing Derivation Restrictions in Generalized Scattered Context Grammars. |
Acta Cybern. |
2008 |
DBLP BibTeX RDF |
|
| 1 | Tomás Masopust, Jirí Techet |
Leftmost Derivations of Propagating Scattered Context Grammars: A New Proof. |
Discrete Mathematics & Theoretical Computer Science |
2008 |
DBLP BibTeX RDF |
|
| 1 | Tomás Masopust, Alexander Meduna |
On Descriptional Complexity of Partially Parallel Grammars. |
Fundam. Inform. |
2008 |
DBLP BibTeX RDF |
|
| 1 | Tomás Masopust, Alexander Meduna |
On Pure Multi-Pushdown Automata that Perform Complete-Pushdown Pops. |
AFL |
2008 |
DBLP BibTeX RDF |
|
| 1 | Tomás Masopust, Alexander Meduna |
Descriptional complexity of semi-conditional grammars. |
Inf. Process. Lett. |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Alexander Meduna, Tomás Masopust |
Self-Regulating Finite Automata. |
Acta Cybern. |
2007 |
DBLP BibTeX RDF |
|
| 1 | Tomás Masopust, Alexander Meduna |
Descriptional Complexity of Grammars Regulated by Context Conditions. |
LATA |
2007 |
DBLP BibTeX RDF |
|
| 1 | Tomás Masopust |
A Note on the Descriptional Complexity of Semi-Conditional Grammars. |
Workshop on Formal Models |
2007 |
DBLP BibTeX RDF |
|
| 1 | Tomás Masopust, Alexander Meduna |
Descriptional Complexity of Generalized Forbidding Grammars. |
DCFS |
2007 |
DBLP BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")