The “last” decision problem for rational trace languages
- 9 June 2005
- book chapter
- Published by Springer Nature
- p. 460-473
- https://doi.org/10.1007/bfb0023848
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- Characterizations of the decidability of some problems for regular trace languagesTheory of Computing Systems, 1989
- On regular trace languagesTheoretical Computer Science, 1987
- Trace languages defined by regular string languagesRAIRO - Theoretical Informatics and Applications, 1986
- Maximal serializability of iterated transactionsTheoretical Computer Science, 1985
- Transductions and Context-Free LanguagesPublished by Springer Nature ,1979
- Reversal-Bounded Multicounter Machines and Their Decision ProblemsJournal of the ACM, 1978
- Semigroups, Presburger formulas, and languagesPacific Journal of Mathematics, 1966
- On Relations Defined by Generalized Finite AutomataIBM Journal of Research and Development, 1965