An application of the theory of free partially commutative monoids: Asymptotic densities of trace languages
From MaRDI portal
Publication:3922190
DOI10.1007/3-540-10856-4_86zbMath0468.68081OpenAlexW1600308590MaRDI QIDQ3922190
Giancarlo Mauri, M. Brambilla, Nicoletta Sabadini, Alberto Bertoni
Publication date: 1981
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/3-540-10856-4_86
Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60) Semigroups in automata theory, linguistics, etc. (20M35)
Related Items
Square-free words on partially commutative free monoids, Traces, dependency graphs and DNLC grammars, On the membership problem for regular DNLC grammars, Asynchronous automata versus asynchronous cellular automata, A decision procedure on partially commutative free monoids, Rewriting systems and word problems in a free partially commutative monoid, Theory of traces, Trace languages defined by regular string languages, Notes on finite asynchronous automata, Non-repetitive words relative to a rewriting system, Preface, Quantum finite automata: advances on Bertoni's ideas, Local testability from words to traces, a suitable definition, Trace monoids with idempotent generators and measure-only quantum automata, On deciding confluence of finite string-rewriting systems modulo partial commutativity, Membership problems for regular and context-free trace languages, Characterizations of the decidability of some problems for regular trace languages, \(\Pi_ 1^ 1\)-universality of some propositional logics of concurrent programs
