Rational languages defined with a non-associative concatenation

DOI10.1016/S0304-3975(98)00043-7zbMath0952.68085MaRDI QIDQ1575941

N. Delaunay

Publication date: 23 August 2000

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

rational languages

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Grammars and rewriting systems (68Q42)

Related Items (3)

Root-restricted Kleenean rotations ⋮ Nonassociativity à la Kleene ⋮ Unnamed Item

Cites Work

• Langages sur des alphabets infinis
• Modèles associatif-rélatif et commutatif cohérents appliqués aux languages réguliers
• Algebra VI. Combinatorial and asymptotic methods of algebra. Non- associative structures. Transl. from the Russian by R. M. Dimitrić
• A Survey on Binary Tree Codings
• A note on generating binary trees inA-order andB-order
• A decidable word problem without equivalent canonical term rewriting system
• Forêts Algébriques et Homomorphismes Inverses
• Mappings and grammars on trees
• Theory of Quasi-Groups
• Quasi-Groups Which Satisfy Certain Generalized Associative Laws
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Rational languages defined with a non-associative concatenation