Pages that link to "Item:Q3922190"
From MaRDI portal
The following pages link to An application of the theory of free partially commutative monoids: Asymptotic densities of trace languages (Q3922190):
Displaying 18 items.
- Quantum finite automata: advances on Bertoni's ideas (Q517033) (← links)
- Local testability from words to traces, a suitable definition (Q728279) (← links)
- Non-repetitive words relative to a rewriting system (Q908710) (← links)
- Square-free words on partially commutative free monoids (Q1076163) (← links)
- Traces, dependency graphs and DNLC grammars (Q1081307) (← links)
- On the membership problem for regular DNLC grammars (Q1082088) (← links)
- A decision procedure on partially commutative free monoids (Q1086682) (← links)
- Rewriting systems and word problems in a free partially commutative monoid (Q1102124) (← links)
- Theory of traces (Q1107296) (← links)
- On deciding confluence of finite string-rewriting systems modulo partial commutativity (Q1262758) (← links)
- \(\Pi_ 1^ 1\)-universality of some propositional logics of concurrent programs (Q1311976) (← links)
- Asynchronous automata versus asynchronous cellular automata (Q1334661) (← links)
- Membership problems for regular and context-free trace languages (Q1824384) (← links)
- Trace languages defined by regular string languages (Q3753510) (← links)
- Notes on finite asynchronous automata (Q3761703) (← links)
- Characterizations of the decidability of some problems for regular trace languages (Q4729376) (← links)
- Preface (Q5898759) (← links)
- Trace monoids with idempotent generators and measure-only quantum automata (Q5962066) (← links)