Characterizations of the decidability of some problems for regular trace languages
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 4035114
- Trace languages defined by regular string languages
- scientific article; zbMATH DE number 4051029
- On the existence of minimum asynchronous automata and on the equivalence problem for unambiguous regular trace languages
- On some decision problems for trace codings
Cites work
- A Note on "The Comparability Graph of a Tree"
- An application of the theory of free partially commutative monoids: Asymptotic densities of trace languages
- Combinatorial problems of commutation and rearrangements
- scientific article; zbMATH DE number 3896285 (Why is no real title available?)
- scientific article; zbMATH DE number 3924146 (Why is no real title available?)
- scientific article; zbMATH DE number 3943051 (Why is no real title available?)
- scientific article; zbMATH DE number 3970130 (Why is no real title available?)
- scientific article; zbMATH DE number 4020497 (Why is no real title available?)
- scientific article; zbMATH DE number 4033664 (Why is no real title available?)
- scientific article; zbMATH DE number 3660804 (Why is no real title available?)
- scientific article; zbMATH DE number 3664335 (Why is no real title available?)
- scientific article; zbMATH DE number 3765179 (Why is no real title available?)
- scientific article; zbMATH DE number 3639163 (Why is no real title available?)
- scientific article; zbMATH DE number 4003555 (Why is no real title available?)
- scientific article; zbMATH DE number 3293666 (Why is no real title available?)
- scientific article; zbMATH DE number 3310089 (Why is no real title available?)
- On the decidability of some problems about rational subsets of free partially commutative monoids
- Partial commutations and faithful rational transductions
- Recognizable subsets of some partially Abelian monoids
- Recursive unsolvability of Post's problem of Tag und other topics in theory of Turing machines
- Reversal-Bounded Multicounter Machines and Their Decision Problems
- Theory of traces
- Trace languages defined by regular string languages
- Traces, dependency graphs and DNLC grammars
Cited in
(37)- Probabilistic estimation of the number of prefixes of a trace
- Rational relations and rational series
- The code problem for traces -- improving the boundaries
- On the support of graph Lie algebras
- Decidability and complexity for quiescent consistency and its variations
- Knapsack in graph groups
- Membership problems for regular and context-free trace languages
- Model-checking of correctness conditions for concurrent objects
- Decidability of split equivalence
- Solving word equations modulo partial commutations
- The word problem for one-relation monoids: a survey
- The emptiness problem for valence automata over graph monoids
- Automated synthesis of application-layer connectors from automata-based specifications
- An Automata-Theoretical Characterization of Context-Free Trace Languages
- RATIONAL SUBSETS IN HNN-EXTENSIONS AND AMALGAMATED PRODUCTS
- WORD EQUATIONS OVER GRAPH PRODUCTS
- Trace languages defined by regular string languages
- scientific article; zbMATH DE number 4020497 (Why is no real title available?)
- scientific article; zbMATH DE number 4035114 (Why is no real title available?)
- scientific article; zbMATH DE number 4051029 (Why is no real title available?)
- scientific article; zbMATH DE number 512855 (Why is no real title available?)
- scientific article; zbMATH DE number 1114346 (Why is no real title available?)
- Intersection problem for Droms RAAGs
- Solving trace equations using lexicographical normal forms
- Fixed points of endomorphisms of trace monoids.
- Logical definability of some rational trace languages
- Bounded context switching for valence systems
- Weak equivalence of higher-dimensional automata
- On the synchronization of semi-traces
- Toward a Structure Theory of Regular Infinitary Trace Languages
- What's decidable about availability languages?
- Decidability of membership problems for flat rational subsets of \(\mathrm{GL}(2,\mathbb{Q})\) and singular matrices
- On some decision problems for trace codings
- Disjointness, inclusion, and regularity of -rational trace languages (extended abstract)
- Subsets of groups in public-key cryptography
- Membership problems in infinite groups
- The submonoid and rational subset membership problems for graph groups.
This page was built for publication: Characterizations of the decidability of some problems for regular trace languages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4729376)
