Valid identity problem for shuffle regular expressions

Authors:
Albert R. Meyer;Alexander Rabinovich
Affiliations:
MIT Laboratory for Computer Science, Cambridge, MA;Department of Computer Science, The Sackler School of Exact Sciences, Tel Aviv University, Israel
Venue:
Journal of Automata, Languages and Combinatorics
Year:
2001

Citing 7
Cited 2

Modeling concurrency with partial orders

International Journal of Parallel Programming
The complexity of word problems—this time with interleaving

Information and Computation
Free shuffle algebras in language varieties

Theoretical Computer Science
A solution of an interleaving decision problem by a partial order technique

POMIV '96 Proceedings of the DIMACS workshop on Partial order methods in verification
Introduction To Automata Theory, Languages, And Computation

Introduction To Automata Theory, Languages, And Computation
On the composition of processes

POPL '82 Proceedings of the 9th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Fully abstract models for a process language with refinement

Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, School/Workshop

Language equations with symmetric difference

CSR'06 Proceedings of the First international computer science conference on Theory and Applications
Language Equations with Symmetric Difference

Fundamenta Informaticae - Words, Graphs, Automata, and Languages; Special Issue Honoring the 60th Birthday of Professor Tero Harju

Quantified Score

Hi-index	0.00

Visualization

Abstract

We show that the following problem is decidable: given are expressions E1 and E2 constructed from variables by the regular operations and shuffle. Is the identity E1 = E2 true for all instantiations of its variables by formal languages?