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
Text languages in an algebraic framework
Fundamenta Informaticae - Special issue on formal language theory
Handbook of formal languages, vol. 3
Information and Computation
Series-parallel languages and the bounded-width property
Theoretical Computer Science
Rationality in algebras with a series operation
Information and Computation
Regular Expressions and Context-Free Grammars for Picture Languages
STACS '97 Proceedings of the 14th Annual Symposium on Theoretical Aspects of Computer Science
A Kleene Iteration for Parallelism
Proceedings of the 18th Conference on Foundations of Software Technology and Theoretical Computer Science
Towards a language theory for infinite N-free pomsets
Theoretical Computer Science
Regular binoid expressions and regular binoid languages
Theoretical Computer Science
Theoretical Computer Science
Journal of Automata, Languages and Combinatorics
A note on identities of two-dimensional languages
Discrete Applied Mathematics
| Hi-index | 5.24 |
We present a nontrivial axiomatization for the equational theory of binoid languages, the subsets of a free binoid. In doing so, we prove that a conjecture given in our previous paper was true: the identical laws of ordinary (string) languages, written separately using 'horizontal' and 'vertical' operation symbols form a required complete system of axioms.