Complexity Issues of the Pattern Equations in Idempotent Semigroups

• Authors: KLÍMA Ondřej; SRBA Jiří
• Year of publication: 1999
• Type: Article in Periodical
• Magazine / Source: Technical Report, Faculty of Informatics, Masaryk University
• MU Faculty or unit: Faculty of Informatics
• web: http://www.fi.muni.cz/informatics/reports/abstract/FIMU-RS-99-02.html
• Field: Information theory
• Keywords: word equations; idempotent semigroup; complexity

Related projects

• Algorithmic Verification Boundaries for Infinite-State Systems
• Non-sequential Models of Computing -- Quantum and Concurrent Distributed Models of Computing