Decidability of split equivalence

DOI10.1006/inco.2001.3074zbMath1009.68080OpenAlexW1997919759MaRDI QIDQ1854504

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) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Decidability of theories and sets of sentences (03B25)

Related Items (1)

Decidability of split equivalence

Cites Work

• Free shuffle algebras in language varieties
• The equational theory of pomsets
• The difference between splitting in \(n\) and \(n+1\)
• Decidability of split equivalence
• The limit of split\(_ n\)-language equivalence
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Decidability of split equivalence