Complexity Issues of the Pattern Equations in Idempotent Semigroups

KLÍMA, Ondřej and Jiří SRBA. Complexity Issues of the Pattern Equations in Idempotent Semigroups. Technical Report, Faculty of Informatics, Masaryk University. Brno, 1999, vol. 1999, No 02, p. 1, 14 s. ISSN FIMU-RS-99-02.

Basic information

• Original name: Complexity Issues of the Pattern Equations in Idempotent Semigroups
• Authors: KLÍMA, Ondřej and Jiří SRBA.
• Edition: Technical Report, Faculty of Informatics, Masaryk University, Brno, 1999, FIMU-RS-99-02.

Other information

• Original language: English
• Type of outcome: Article in a journal
• Field of Study: 10000 1. Natural Sciences
• Country of publisher: Czech Republic
• Confidentiality degree: is not subject to a state or trade secret
• WWW: URL
• RIV identification code: RIV/00216224:14330/99:00001718
• Organization unit: Faculty of Informatics
• Keywords in English: word equations; idempotent semigroup; complexity
• Tags: complexity, idempotent semigroup, word equations

Links

• GA201/97/0456, research and development project: Name: Meze algoritmické verifikovatelnosti nekonečně stavových systémů

Investor: Czech Science Foundation, Algorithmic Verification Boundaries for 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