Pages that link to "Item:Q4729376"
From MaRDI portal
The following pages link to Characterizations of the decidability of some problems for regular trace languages (Q4729376):
Displaying 22 items.
- Fixed points of endomorphisms of trace monoids. (Q467531) (← links)
- On some decision problems for trace codings (Q672324) (← links)
- The submonoid and rational subset membership problems for graph groups. (Q947493) (← links)
- Probabilistic estimation of the number of prefixes of a trace (Q1184996) (← links)
- Rational relations and rational series (Q1194313) (← links)
- The code problem for traces -- improving the boundaries (Q1392032) (← links)
- On the support of graph Lie algebras (Q1605344) (← links)
- Decidability and complexity for quiescent consistency and its variations (Q1680503) (← links)
- Knapsack in graph groups (Q1702854) (← links)
- Model-checking of correctness conditions for concurrent objects (Q1854357) (← links)
- Solving word equations modulo partial commutations (Q1960424) (← links)
- The word problem for one-relation monoids: a survey (Q1982573) (← links)
- The emptiness problem for valence automata over graph monoids (Q2662504) (← links)
- Automated Synthesis of Application-Layer Connectors from Automata-Based Specifications (Q2799159) (← links)
- RATIONAL SUBSETS IN HNN-EXTENSIONS AND AMALGAMATED PRODUCTS (Q3502750) (← links)
- WORD EQUATIONS OVER GRAPH PRODUCTS (Q3521473) (← links)
- Intersection problem for Droms RAAGs (Q4554881) (← links)
- Solving trace equations using lexicographical normal forms (Q4571965) (← links)
- Logical definability of some rational trace languages (Q4850330) (← links)
- Bounded Context Switching for Valence Systems (Q5009426) (← links)
- Weak equivalence of higher-dimensional automata (Q5038191) (← links)
- On the synchronization of semi-traces (Q5055913) (← links)
