Decidability of split equivalence

DOI10.1006/INCO.2001.3074MaRDI QIDQ1854504zbMATH OpenOpenAlexFDO

Authors 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

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)

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

Cites work

• scientific article; zbMATH DE number 3427224 (Why is no real title available?)
• scientific article; zbMATH DE number 3722109 (Why is no real title available?)
• scientific article; zbMATH DE number 1995152 (Why is no real title available?)
• Decidability of split equivalence
• Free shuffle algebras in language varieties
• The difference between splitting in \(n\) and \(n+1\)
• The equational theory of pomsets
• The limit of split\(_ n\)-language equivalence

Cited in

(2)

• Decidability of split equivalence
• scientific article; zbMATH DE number 1809725 (Why is no real title available?)

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)