Tomás Masopust

Theor. Comput. Sci., 2017

Complexity of universality and related problems for partially ordered NFAs.

[BibT_eX]

[DOI]

Markus Krötzsch

Inf. Comput., 2017

Computation of controllable and coobservable sublanguages in decentralized supervisory control via communication.

[BibT_eX]

[DOI]

Discret. Event Dyn. Syst., 2017

Universality of Confluent, Self-Loop Deterministic Partially Ordered NFAs is Hard.

[BibT_eX]

[DOI]

Markus Krötzsch

CoRR, 2017

2016

Distributed computation of supremal conditionally controllable sublanguages.

[BibT_eX]

[DOI]

Int. J. Control, 2016

On a Distributed Computation of Supervisors in Modular Supervisory Control.

[BibT_eX]

[DOI]

CoRR, 2016

Control of an engineering-structured multilevel discrete-event system.

[BibT_eX]

[DOI]

Proceedings of the 13th International Workshop on Discrete Event Systems, 2016

Piecewise Testable Languages and Nondeterministic Automata.

[BibT_eX]

[DOI]

Proceedings of the 41st International Symposium on Mathematical Foundations of Computer Science, 2016

On the Complexity of Universality for Partially Ordered NFAs.

[BibT_eX]

[DOI]

Markus Krötzsch

Proceedings of the 41st International Symposium on Mathematical Foundations of Computer Science, 2016

Distributed computation of maximally permissive supervisors in three-level relaxed coordination control of discrete-event systems.

[BibT_eX]

[DOI]

Proceedings of the 55th IEEE Conference on Decision and Control, 2016

2015

Coordination control of discrete-event systems revisited.

[BibT_eX]

[DOI]

Discret. Event Dyn. Syst., 2015

On the Computation of Controllable and Coobservable Sublanguages in Decentralized Supervisory Control.

[BibT_eX]

[DOI]

CoRR, 2015

On the Complexity of k-Piecewise Testability and the Depth of Automata.

[BibT_eX]

[DOI]

Proceedings of the Developments in Language Theory - 19th International Conference, 2015

Relative observability in coordination control.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Conference on Automation Science and Engineering, 2015

Multilevel coordination control of partially observed modular DES.

[BibT_eX]

[DOI]

Proceedings of the American Control Conference, 2015

2014

On $k$-piecewise testability (preliminary report).

[BibT_eX]

[DOI]

CoRR, 2014

A Note on Relative Observability in Coordination Control.

[BibT_eX]

[DOI]

CoRR, 2014

Maximally Permissive Coordination Supervisory Control - Towards Necessary and Sufficient Conditions.

[BibT_eX]

[DOI]

CoRR, 2014

On Upper and Lower Bounds on the Length of Alternating Towers.

[BibT_eX]

[DOI]

CoRR, 2014

Alternating Towers and Piecewise Testable Separators.

[BibT_eX]

[DOI]

Stepan Holub

CoRR, 2014

On Upper and Lower Bounds on the Length of Alternating Towers.

[BibT_eX]

[DOI]

Stepan Holub

Proceedings of the Mathematical Foundations of Computer Science 2014, 2014

Bottom-up approach to multilevel supervisory control with coordination.

[BibT_eX]

[DOI]

Proceedings of the 13th European Control Conference, 2014

Decentralized supervisory control with communicating supervisors based on top-down coordination control.

[BibT_eX]

[DOI]

Proceedings of the 53rd IEEE Conference on Decision and Control, 2014

2013

A Note on Limited Pushdown Alphabets in Stateless Deterministic Pushdown Automata.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2013

On the State Complexity of the Reverse of R- and J-trivial Regular Languages

[BibT_eX]

[DOI]

CoRR, 2013

Efficient Separability of Regular Languages by Subsequences and Suffixes.

[BibT_eX]

[DOI]

Wojciech Czerwinski

Wim Martens

Proceedings of the Automata, Languages, and Programming - 40th International Colloquium, 2013

On the State Complexity of the Reverse of - and -Trivial Regular Languages.

[BibT_eX]

[DOI]

Proceedings of the Descriptional Complexity of Formal Systems, 2013

Multilevel coordination control of modular DES.

[BibT_eX]

[DOI]

Proceedings of the 52nd IEEE Conference on Decision and Control, 2013

A bridge between decentralized and coordination control.

[BibT_eX]

[DOI]

Proceedings of the 51st Annual Allerton Conference on Communication, 2013

Supervisory Control with Complete Observations.

[BibT_eX]

[DOI]

Proceedings of the Control of Discrete-Event Systems, 2013

Coordination Control of Distributed Discrete-Event Systems.

[BibT_eX]

[DOI]

Proceedings of the Control of Discrete-Event Systems, 2013

Supervisory Control of Distributed Discrete-Event Systems.

[BibT_eX]

[DOI]

Proceedings of the Control of Discrete-Event Systems, 2013

Languages, Decidability, and Complexity.

[BibT_eX]

[DOI]

Stefan Haar

Proceedings of the Control of Discrete-Event Systems, 2013

2012

On a structural property in the state complexity of projected regular languages.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2012

On conditional decomposability.

[BibT_eX]

[DOI]

Syst. Control. Lett., 2012

On restricted context-free grammars.

[BibT_eX]

[DOI]

Jürgen Dassow

J. Comput. Syst. Sci., 2012

A Note on Undecidability of Observation Consistency for Non-Regular Languages

[BibT_eX]

[DOI]

CoRR, 2012

A note on controllability of deterministic context-free systems.

[BibT_eX]

[DOI]

Autom., 2012

Supervisory control synthesis of discrete-event systems using a coordination scheme.

[BibT_eX]

[DOI]

Autom., 2012

On algorithms and extensions of coordination control of discrete-event systems.

[BibT_eX]

[DOI]

Proceedings of the 11th International Workshop on Discrete Event Systems, 2012

On the State and Computational Complexity of the Reverse of Acyclic Minimal DFAs.

[BibT_eX]

[DOI]

Proceedings of the Implementation and Application of Automata, 2012

On Properties and State Complexity of Deterministic State-Partition Automata.

[BibT_eX]

[DOI]

Proceedings of the Theoretical Computer Science, 2012

2011

Synthesis of controllable and normal sublanguages for discrete-event systems using a coordinator.

[BibT_eX]

[DOI]

Syst. Control. Lett., 2011

Complexity in Union-Free Regular Languages.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2011

Blackhole Pushdown Automata.

[BibT_eX]

[DOI]

Erzsébet Csuhaj-Varjú

György Vaszil

Fundam. Informaticae, 2011

Control of Distributed Systems: Tutorial and Overview.

[BibT_eX]

[DOI]

Eur. J. Control, 2011

Cooperating Distributed Grammar Systems with Random Context Grammars as Components.

[BibT_eX]

[DOI]

Zbynek Krivka

Acta Cybern., 2011

State Complexity of Projected Languages.

[BibT_eX]

[DOI]

Proceedings of the Descriptional Complexity of Formal Systems, 2011

Hierarchical control with partial observations: Sufficient conditions.

[BibT_eX]

[DOI]

Proceedings of the 50th IEEE Conference on Decision and Control and European Control Conference, 2011

2010

Left-forbidding cooperating distributed grammar systems.

[BibT_eX]

[DOI]

Filip Goldefus

Theor. Comput. Sci., 2010

Simple restriction in context-free rewriting.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2010

Regulated Nondeterminism in Pushdown Automata: The Non-Regular Case.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2010

Bounded Number of Parallel Productions in Scattered Context Grammars with Three Nonterminals.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2010

Comparison of Two Context-Free Rewriting Systems with Simple Context-Checking Mechanisms

[BibT_eX]

[DOI]

CoRR, 2010

Synthesis of safe sublanguages satisfying global specification using coordination scheme for discrete-event systems.

[BibT_eX]

[DOI]

Proceedings of the 10th International Workshop on Discrete Event Systems, 2010

Supremal normal sublanguages in hierarchical supervisory control.

[BibT_eX]

[DOI]

Proceedings of the 10th International Workshop on Discrete Event Systems, 2010

Blackhole State-Controlled Regulated Pushdown Automata.

[BibT_eX]

Erzsébet Csuhaj-Varjú

György Vaszil

Proceedings of the Second Workshop on Non-Classical Models for Automata and Applications - NCMA 2010, Jena, Germany, August 23, 2010

2009

On the descriptional complexity of scattered context grammars.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2009

On context-free rewriting with a simple restriction and its computational completeness.

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 2009

On the Terminating Derivation Mode in Cooperating Distributed Grammar Systems with Forbidding Components.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2009

Descriptional Complexity of Three-Nonterminal Scattered Context Grammars: An Improvement

[BibT_eX]

[DOI]

Proceedings of the Proceedings Eleventh International Workshop on Descriptional Complexity of Formal Systems, 2009

Answers to Questions Formulated in the Paper "On States Observability in Deterministic Finite Automata"

[BibT_eX]

[DOI]

CoRR, 2009

On Pure Multi-Pushdown Automata that Perform Complete Pushdown Pops.

[BibT_eX]

[DOI]

Acta Cybern., 2009

Regulated Nondeterminism in PDAs: The Non-Regular Case.

[BibT_eX]

Proceedings of the Workshop on Non-Classical Models for Automata and Applications - NCMA 2009, Wroclaw, Poland, August 31, 2009

A Note on the Generative Power of Some Simple Variants of Context-Free Grammars Regulated by Context Conditions.

[BibT_eX]

[DOI]

Proceedings of the Language and Automata Theory and Applications, 2009

A Note on the Cooperation in Rewriting Systems with Context-Dependency Checking.

[BibT_eX]

Zbynek Krivka

Proceedings of the Theoretical Computer Science, 11th Italian Conference, 2009

2008

Descriptional complexity of multi-parallel grammars.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2008

On Descriptional Complexity of Partially Parallel Grammars.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2008

Leftmost Derivations of Propagating Scattered Context Grammars: A New Proof.

[BibT_eX]

[DOI]

Jirí Techet

Discret. Math. Theor. Comput. Sci., 2008

Two Power-Decreasing Derivation Restrictions in Generalized Scattered Context Grammars.

[BibT_eX]

[DOI]

Jirí Simácek

Acta Cybern., 2008

2007

Descriptional complexity of semi-conditional grammars.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2007

Self-Regulating Finite Automata.

[BibT_eX]

[DOI]

Acta Cybern., 2007

Descriptional Complexity of Grammars Regulated by Context Conditions.

[BibT_eX]

Proceedings of the LATA 2007. Proceedings of the 1st International Conference on Language and Automata Theory and Applications., 2007

A Note on the Descriptional Complexity of Semi-Conditional Grammars.

[BibT_eX]

[DOI]

Proceedings of the 2nd International Workshop on Formal Models WFM'07, 2007

Descriptional Complexity of Generalized Forbidding Grammars.

[BibT_eX]