A Finite Axiomatization of Nondeterministic Regular Expressions

DOI10.1051/ita:1999127zbMath0945.68122MaRDI QIDQ4943553

Anna Labella, Flavio Corradini, Rocco De Nicola

Publication date: 3 October 2000

Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/221958

zbMATH Keywords

regular expressions; regular languages

Mathematics Subject Classification ID

68Q55: Semantics in the theory of computing

08B05: Equational logic, Mal'tsev conditions

Related Items

Nondeterministic regular expressions as solutions of equational systems., Categories with sums and right distributive tensor product

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A complete inference system for a class of regular behaviours
• A calculus of communicating systems
• Complete systems of \(\mathcal B\)-rational identities
• Iteration theories of synchronization trees
• Enriched categorical semantics for distributed calculi
• A completeness theorem for Kleene algebras and the algebra of regular events
• An equational axiomatization for multi-exit iteration
• Axiomatizing prefix iteration with silent steps
• Models of nondeterministic regular expressions
• Une remarque sur les systèmes complets d'identités rationnelles
• Tree-functors, determinacy and bisimulations
• The Category-Theoretic Solution of Recursive Domain Equations
• Communicating sequential processes
• Step bisimulation is pomset equivalence on a parallel language without explicit internal choice
• Axiomatizations for the perpetual loop in process algebra
• Two Complete Axiom Systems for the Algebra of Regular Events