„regular languages“
Suchergebnisse
304 Treffer
-
On the Complexity of Branching Games with Regular Conditions
-
The Covering Problem: A Unified Approach for Investigating the Expressive Power of Logics
-
Eulerian Paths with Regular Constraints
-
Families of DFAs as Acceptors of omega-Regular Languages
-
Characterizing Classes of Regular Languages Using Prefix Codes of Bounded Synchronization Delay
-
The Bridge Between Regular Cost Functions and Omega-Regular Languages
-
New Interpretation and Generalization of the Kameda-Weiner Method
-
Deciding Piecewise Testable Separability for Regular Tree Languages
-
On the Problem of Computing the Probability of Regular Sets of Trees
-
The Sensing Cost of Monitoring and Synthesis
-
Efficient Algorithms for Morphisms over Omega-Regular Languages
-
On Unambiguous Regular Tree Languages of Index (0,2)
-
On Relative and Probabilistic Finite Counterability
-
Proving non-termination by finite automata
-
Separation and the Successor Relation
-
Regular Sensing
-
First-order Fragments with Successor over Infinite Words
-
Fragments of First-Order Logic over Infinite Words
-
On the Structure and Complexity of Rational Sets of Regular Languages
-
Separating Regular Languages by Locally Testable and Locally Threshold Testable Languages