On confluent semi-commutations — Decidability and complexity results
Bibliographic Data
| ID | 23571138 |
|---|---|
| Authors | Volker Diekert (0000-0002-5994-3762, Technical University of Munich), Edward Ochmanski (Institute of Computer Science), Klaus Reinhardt (0000-0003-4205-2370, University of Stuttgart) |
| Year | 1991 |
| Pages | 229-241 |
| Publication date | 1991-01-01 |
| Peer Reviewed | Yes |
| Open Access | No |
| Type | CHAPTER |
| Venue | Automata, Languages and Programming (SOURCE_BOOK) |
| Publisher | Springer Berlin Heidelberg (PUBLISHER) |
| DOI | 10.1007/3-540-54233-7_137 |
| OpenAlex | W1571237816 |
| ISBN | 9783540542339 |
| Language | EN |
| References cited | 7 |
Algebra over a field · Commutation · Confluence · Decidability · Discrete mathematics · Programming language · Property (philosophy) · Pure mathematics · TRACE (psycholinguistics) · Voltage · Advanced Algebra and Logic · Computability, Logic, AI Algorithms · Computer Science · Mathematics · semigroups and automata theory
| Citation velocity | historical |
|---|---|
| Highly cited | No |