scientific article; zbMATH DE number 1113856
From MaRDI portal
Publication:4375630
zbMath0886.03032MaRDI QIDQ4375630
Publication date: 10 May 1998
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Formal languages and automata (68Q45) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Automata and formal grammars in connection with logical questions (03D05) Semantics in the theory of computing (68Q55)
Related Items (9)
An equational axiomatization for multi-exit iteration ⋮ Axiomatizations for the perpetual loop in process algebra ⋮ Termination modulo equations by abstract commutation with an application to iteration ⋮ Using Hoare Logic in a Process Algebra Setting ⋮ Complete Axiomatization for Divergent-Sensitive Bisimulations in Basic Process Algebra with Prefix Iteration ⋮ Is observational congruence on \(\mu \)-expressions axiomatisable in equational Horn logic? ⋮ A Finite Axiomatization of Nondeterministic Regular Expressions ⋮ Equational theories for automata ⋮ Bisimilarity of open terms.
This page was built for publication:
