scientific article; zbMATH DE number 7350780
From MaRDI portal
Publication:4989409
Tomáš Masopust, Markus Krötzsch
Publication date: 25 May 2021
Full work available at URL: https://arxiv.org/abs/1907.13115
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (3)
State Complexity of Permutation and the Language Inclusion Problem up to Parikh Equivalence on Alphabetical Pattern Constraints and Partially Ordered NFAs ⋮ On verification of D-detectability for discrete event systems ⋮ State complexity of permutation and related decision problems on alphabetical pattern constraints
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Generalized detectability for discrete event systems
- Constraint solving for interpolation
- Opacity of discrete event systems and its applications
- Finite-automaton aperiodicity is PSPACE-complete
- Permutation rewriting and algorithmic verification
- A note on partially ordered tree automata
- The complementation problem for Büchi automata with applications to temporal logic
- Finite automata and unary languages
- Languages of R-trivial monoids
- A generalization of the Schützenberger product of finite monoids
- Classification of finite monoids: the language approach
- Alternating automata, the weak monadic theory of trees and its complexity
- Space-bounded reducibility among combinatorial problems
- The inclusion problem for simple languages
- The dot-depth hierarchy of star-free languages is infinite
- Sur le produit de concatenation non ambigu
- Polynomial closure and unambiguous product
- Computation of controllable and coobservable sublanguages in decentralized supervisory control via communication
- Supervisory control and reactive synthesis: a comparative introduction
- Separability by piecewise testable languages is \textsc{PTime}-complete
- Complexity of detectability, opacity and A-diagnosability for modular discrete event systems
- Complexity of deciding detectability in discrete event systems
- Complexity of universality and related problems for partially ordered NFAs
- Finite semigroup varieties of the form V*D
- Coordination control of discrete-event systems revisited
- On Boolean combinations forming piecewise testable languages
- Languages of dot-depth 3/2
- Dot-depth of star-free events
- On the structure of semigroups
- On Separation by Locally Testable and Locally Threshold Testable Languages
- The Complexity of Answering Conjunctive and Navigational Queries over OWL 2 EL Knowledge Bases
- Piecewise testable tree languages
- Querying Regular Graph Patterns
- PARTIALLY ORDERED TWO-WAY BÜCHI AUTOMATA
- Linear reasoning. A new form of the Herbrand-Gentzen theorem
- Evaluation and Enumeration Problems for Regular Path Queries
- On Decidability of Intermediate Levels of Concatenation Hierarchies
- Observability of discrete event dynamic systems
- A SURVEY ON SMALL FRAGMENTS OF FIRST-ORDER LOGIC OVER FINITE WORDS
- Weak alternating automata are not that weak
- Around Dot Depth Two
- Complexity of Decision Problems for XML Schemas and Chain Regular Expressions
- Separating regular languages with two quantifier alternations
- The equivalence problem for deterministic pushdown automata is decidable
- Separating Regular Languages with Two Quantifiers Alternations
- The Power of Programs over Monoids in DA
- Detectability of Discrete Event Systems
- Alternative Automata Characterization of Piecewise Testable Languages
- Efficient Separability of Regular Languages by Subsequences and Suffixes
- The Common Fragment of ACTL and LTL
- Alternation Elimination by Complementation (Extended Abstract)
This page was built for publication:
