Regularity is Decidable for Normed BPA and Normed BPP Processes in Polynomial Time.

Kučera,  Antonín

Regularity is Decidable for Normed BPA and Normed BPP Processes in Polynomial Time.

Warning

This publication doesn't include Institute of Computer Science. It includes Faculty of Informatics. Official publication website can be found on muni.cz.

Authors	KUČERA Antonín
Year of publication	1996
Type	Article in Proceedings
Conference	Proceedings of 23rd Seminar on Current Trends in Theory and Practice of Informatics (SOFSEM´96)
MU Faculty or unit	Faculty of Informatics
Citation
Field	Computer hardware and software
Keywords	concurrency; bisimilarity; regularity
Related projects:	Analysis of Concurrent Infinite State Systems Non-sequential Models of Computing -- Quantum and Concurrent Distributed Models of Computing