Complete systems of B -rational identities
Theoretical Computer Science
A completeness theorem for Kleene algebras and the algebra of regular events
Papers presented at the IEEE symposium on Logic in computer science
Completeness of Park induction
MFPS '94 Proceedings of the tenth conference on Mathematical foundations of programming semantics
A New Normal-Form Theorem for Context-Free Phrase Structure Grammars
Journal of the ACM (JACM)
Two Complete Axiom Systems for the Algebra of Regular Events
Journal of the ACM (JACM)
Matrix Equations and Normal Forms for Context-Free Grammars
Journal of the ACM (JACM)
Introduction to Formal Language Theory
Introduction to Formal Language Theory
On the Equational Definition of the Least Prefixed Point
MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science
Action Logic and Pure Induction
JELIA '90 Proceedings of the European Workshop on Logics in AI
Towards Kleene Algebra with Recursion
CSL '91 Proceedings of the 5th Workshop on Computer Science Logic
On the Complexity of Reasoning in Kleene Algebra
LICS '97 Proceedings of the 12th Annual IEEE Symposium on Logic in Computer Science
Parikh's Theorem in Commutative Kleene Algebra
LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science
Algebraic systems and pushdown automata
Algebraic Foundations in Computer Science
| Hi-index | 0.00 |
We give inequational and equational axioms for semirings with a fixed-point operator and formally develop a fragment of the theory of context-free languages. In particular, we show that Greibach's normal form theorem depends only on a few equational properties of least pre-fixed-points in semirings, and elimination of chain- and deletion rules depend on their inequational properties (and the idempotency of addition). It follows that these normal form theorems also hold in non-continuous semirings having enough fixed-points.