Pages that link to "Item:Q865624"

The following pages link to Permutation rewriting and algorithmic verification (Q865624):

Displaying 17 items.

• Regular languages and partial commutations (Q391641) (← links)
• Local testability from words to traces, a suitable definition (Q728279) (← links)
• A note on partially ordered tree automata (Q975463) (← links)
• Iterating transducers (Q1858440) (← links)
• Complexity of universality and related problems for partially ordered NFAs (Q2013561) (← links)
• Geometrically closed positive varieties of languages (Q2084767) (← links)
• The commutative closure of shuffle languages over group languages is regular (Q2117662) (← links)
• State complexity of permutation and related decision problems on alphabetical pattern constraints (Q2117669) (← links)
• AUTOMATIC VERIFICATION OF DIRECTORY-BASED CONSISTENCY PROTOCOLS WITH GRAPH CONSTRAINTS (Q3016215) (← links)
• A Normalized Form for FIFO Protocols Traces, Application to the Replay of Mode-based Protocols (Q3460215) (← links)
• Efficiency of automata in semi-commutation verification techniques (Q3515458) (← links)
• A Robust Class of Regular Languages (Q3599114) (← links)
• Automatic Verification of Directory-Based Consistency Protocols (Q3646250) (← links)
• Regular Model Checking using Widening Techniques (Q4921501) (← links)
• (Q4989409) (← links)
• Bounded Communication Reachability Analysis of Process Rewrite Systems with Ordered Parallelism (Q5179049) (← links)
• State Complexity of Permutation and the Language Inclusion Problem up to Parikh Equivalence on Alphabetical Pattern Constraints and Partially Ordered NFAs (Q6070752) (← links)