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. K.G. Jeffery, J. Král, M. Bartošek (Eds.). In Proceedings of 23rd Seminar on Current Trends in Theory and Practice of Informatics (SOFSEM´96). Berlin: Springer, 1996, p. 377-384. Lecture Notes in Computer Science, vol. 1175. ISBN 3-540-61994-1.

Basic information

• Original name: Regularity is Decidable for Normed BPA and Normed BPP Processes in Polynomial Time.
• Authors: KUČERA, Antonín.; K.G. Jeffery, J. Král, M. Bartošek (Eds.).
• Edition: Berlin, Proceedings of 23rd Seminar on Current Trends in Theory and Practice of Informatics (SOFSEM´96), p. 377-384, Lecture Notes in Computer Science, vol. 1175, 1996.
• Publisher: Springer

Other information

• Original language: English
• Type of outcome: Proceedings paper
• Field of Study: 20206 Computer hardware and architecture
• Country of publisher: Germany
• Confidentiality degree: is not subject to a state or trade secret
• RIV identification code: RIV/00216224:14330/96:00000073
• Organization unit: Faculty of Informatics
• ISBN: 3-540-61994-1
• Keywords in English: concurrency; bisimilarity; regularity
• Tags: bisimilarity, concurrency, regularity

Links

• GA201/93/2123, research and development project: Name: Analýza konkurentních nekonečně stavových systémů

Investor: Czech Science Foundation, Analysis of Concurrent Infinite State Systems

• MSM 143300001, plan (intention): Name: Nesekvenční modely výpočtů - kvantové a souběžné distribuované modely výpočetních procesů

Investor: Ministry of Education, Youth and Sports of the CR, Non-sequential Models of Computing -- Quantum and Concurrent Distributed Models of Computing