scientific article; zbMATH DE number 1754619
From MaRDI portal
zbMath0986.20036MaRDI QIDQ4535046
Publication date: 12 June 2002
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2076/20760543
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Complexity of computation (including implicit computational complexity) (03D15) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10)
Related Items
Word equations in the context of string solving, One-relator quotients of right-angled Artin groups, Parabolic and quasiparabolic subgroups of free partially commutative groups., Recognizing string graphs in NP, The isomorphism problem for toral relatively hyperbolic groups., The existential theory of equations with rational constraints in free groups is PSPACE-complete