The star problem and the finite power property in trace monoids: reductions beyond C4
Information and Computation
Message Sequence Graphs and Decision Problems on Mazurkiewicz Traces
MFCS '99 Proceedings of the 24th International Symposium on Mathematical Foundations of Computer Science
Two Techniques in the Area of the Star Problem
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
A Connection between the Star Problem and the Finite Power Property in Trace Monoids
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
The Star Problem in Trace Monoids: Reductions Beyond C4
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
Compositionality in Dataflow Synchronous Languages: Specification and Code Generation
COMPOS'97 Revised Lectures from the International Symposium on Compositionality: The Significant Difference
Automatic Production of Globally Asynchronous Locally Synchronous Systems
EMSOFT '02 Proceedings of the Second International Conference on Embedded Software
The word problem for 1LC congruences is NP-hard
Theoretical Computer Science
Two techniques in the area of the star problem in trace monoids
Theoretical Computer Science
A theory of regular MSC languages
Information and Computation
On Star-Connected Flat Languages
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P 2004)
Star-Connected Flat Languages and Automata
Fundamenta Informaticae - SPECIAL ISSUE ON CONCURRENCY SPECIFICATION AND PROGRAMMING (CS&P 2005) Ruciane-Nide, Poland, 28-30 September 2005
Characterization of Star-Connected Languages Using Finite Automata
Language and Automata Theory and Applications
A theory of regular MSC languages
Information and Computation
Some undecidability results related to the star problem in trace monoids
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
Analysing message sequence graph specifications
ISoLA'10 Proceedings of the 4th international conference on Leveraging applications of formal methods, verification, and validation - Volume Part I
Post correspondence problem with partially commutative alphabets
LATA'10 Proceedings of the 4th international conference on Language and Automata Theory and Applications
Star-Connected Flat Languages and Automata
Fundamenta Informaticae - SPECIAL ISSUE ON CONCURRENCY SPECIFICATION AND PROGRAMMING (CS&P 2005) Ruciane-Nide, Poland, 28-30 September 2005
On Star-Connected Flat Languages
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P 2004)
Fair Synthesis for Asynchronous Distributed Systems
ACM Transactions on Computational Logic (TOCL)
Regular languages and partial commutations
Information and Computation
| Hi-index | 0.00 |