Sur la classification syntaxique

DOI10.1007/BF02572842zbMath0514.20052OpenAlexW2079408626MaRDI QIDQ1051097

Jean-Claude Spehner

Publication date: 1983

Published in: Semigroup Forum (Search for Journal in Brave)

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

zbMATH Keywords

formal languagesprefix codefree monoidssuffix codebiprefix codeessential syntactic classes

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Semigroups in automata theory, linguistics, etc. (20M35)

Related Items (1)

A bijection between cliques in graphs and factorizations in free monoids

Cites Work

• Unnamed Item
• Unnamed Item
• Synchronization and simplification
• Équivalences principales bilateres definies dans un demi-groupe
• Sur le calcul du monoide syntaxique d'un sous monoide finiment engendre
• Presentations et presentations simplifiables d'un monoide simplifiable
• Quelques constructions et algorithmes rélatifs aux sous-monoides d'un monoide libre
• Periodes et repetitions des mots du monoide libre
• On the structure of semigroups
• Depth-First Search and Linear Graph Algorithms

This page was built for publication: Sur la classification syntaxique