Recognizable and rational languages of finite and infinite traces
- 13 November 2005
- book chapter
- Published by Springer Nature
- p. 89-104
- https://doi.org/10.1007/bfb0020790
Abstract
No abstract availableKeywords
This publication has 17 references indexed in Scilit:
- Un modèle asynchrone pour les systèmes distribuésTheoretical Computer Science, 1990
- Infinite tracesPublished by Springer Nature ,1990
- Combinatorics on TracesPublished by Springer Nature ,1990
- Theory of tracesTheoretical Computer Science, 1988
- Une condition suffisante de reconnaissabilité dans un monoïde partiellement commutatifRAIRO - Theoretical Informatics and Applications, 1986
- On recognizable subsets of free partially commutative monoidsLecture Notes in Computer Science, 1986
- Infinitary languages: Basic theory and applications to concurrent systemsPublished by Springer Nature ,1986
- Maximal serializability of iterated transactionsTheoretical Computer Science, 1985
- A syntactic congruence for rational ω-languagesTheoretical Computer Science, 1985
- Recognizable subsets of some partially abelian monoidsTheoretical Computer Science, 1985