Confluence problems for trace rewriting systems
Information and Computation
Complexity Results for Confluence Problems
MFCS '99 Proceedings of the 24th International Symposium on Mathematical Foundations of Computer Science
Realizability and verification of MSC graphs
Theoretical Computer Science - Automata, languages and programming
Efficient recognition of trace languages defined by repeat-until loops
Information and Computation
An automata-theoretical characterization of context-free trace languages
SOFSEM'11 Proceedings of the 37th international conference on Current trends in theory and practice of computer science
On restarting automata with window size one
DCFS'11 Proceedings of the 13th international conference on Descriptional complexity of formal systems
Parsing by matrix multiplication generalized to Boolean grammars
Theoretical Computer Science
| Hi-index | 0.00 |