Rational series and their languages
Rational series and their languages
Formal languages and power series
Handbook of theoretical computer science (vol. B)
Semirings and formal power series: their relevance to formal languages and automata
Handbook of formal languages, vol. 1
Handbook of formal languages, vol. 3
Handbook of formal languages, vol. 3
Languages rationnels définis avec une concaténation non-associative
Theoretical Computer Science
On a class of regular-like expressions for linear languages
Journal of Automata, Languages and Combinatorics
Canonical Equational Proofs
Linear languages with a nonassociative concatenation
Journal of Automata, Languages and Combinatorics
Generating binary trees by Glivenko classes on Tamari lattices
Information Processing Letters
A Kleene/Büchi-like theorem for clock languages
Journal of Automata, Languages and Combinatorics - Selected papers of the workshop on logic and algebra for concurrency
CAI'07 Proceedings of the 2nd international conference on Algebraic informatics
Root-restricted Kleenean rotations
Information Processing Letters
| Hi-index | 0.00 |
The aim of this paper is to generalize to nonassociative concatenation the well-known property that the family of left-linear languages is exactly the family of regular languages. For this purpose, we introduce a generalized Kleene star operation.