Sjednocujeme pohled na rozšíření procesových přepisovacích systemů a prezentujeme důkaz rozhodnutelnosti problému dosažitelnosti pro procesové přepisovací systémy rozšířené o slabou konečně stavovou jednotku. (cs)
We unify a view on three extensions of Process Rewrite Systems (PRS) and compare their expressive power with that of PRS. We show that the reachability problem for PRS extended with a so called weak finite state unit is decidable.
We unify a view on three extensions of Process Rewrite Systems (PRS) and compare their expressive power with that of PRS. We show that the reachability problem for PRS extended with a so called weak finite state unit is decidable. (en)