Decidability of split equivalence

DOI10.1006/INCO.2001.3074zbMATH Open1009.68080OpenAlexW1997919759MaRDI QIDQ1854504FDOQ1854504

Y. Abramson, Alexander Rabinovich

Publication date: 14 January 2003

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/1783694d04222f4d3528cf8208ca20090ab46304

Recommendations

• scientific article; zbMATH DE number 1809725
• scientific article; zbMATH DE number 1555184
• scientific article; zbMATH DE number 871236
• Characterizations of the decidability of some problems for regular trace languages
• Petri nets and regular processes

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05) Decidability of theories and sets of sentences (03B25) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Cites Work

• The difference between splitting in \(n\) and \(n+1\)
• Title not available (Why is that?)
• The equational theory of pomsets
• Free shuffle algebras in language varieties
• Title not available (Why is that?)
• Title not available (Why is that?)
• The limit of split\(_ n\)-language equivalence
• Decidability of split equivalence

Cited In (2)

• Decidability of split equivalence
• Title not available (Why is that?)

This page was built for publication: Decidability of split equivalence

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1854504)