scientific article

zbMath0644.68099MaRDI QIDQ3787509

Giovanni Pighizzini, Danilo Bruschi, Nicoletta Sabadini

Publication date: 1988

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

equivalenceconcurrent systemsdecidabilityrecognizable trace languagefinite state asynchronous automatonunambiguous regular trace languages

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Theory of operating systems (68N25)

Related Items

Asynchronous automata versus asynchronous cellular automata, Distribution and synchronized automata, Probabilistic estimation of the number of prefixes of a trace, On the decidability of the equivalence problem for partially commutative rational power series