scientific article
From MaRDI portal
Publication:3771597
zbMath0633.68015MaRDI QIDQ3771597
Publication date: 1987
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45) Abstract data types; algebraic specification (68Q65) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Semigroups in automata theory, linguistics, etc. (20M35)
Related Items (6)
Preperfectness is undecidable for Thue systems containing only length- reducing rules and a single commutation rule ⋮ The word problem for free partially commutative groups ⋮ On confluence of one-rule trace-rewriting systems ⋮ On deciding confluence of finite string-rewriting systems modulo partial commutativity ⋮ Word problems over traces which are solvable in linear time ⋮ Confluence problems for trace rewriting systems
This page was built for publication:
