Monoides pointes

DOI10.1007/BF02574188zbMath0419.68093OpenAlexW3187421818MaRDI QIDQ1132637

Jacques Sakarovitch

Publication date: 1979

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

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

zbMATH Keywords

abstract machinessyntactic monoidendomorphisms of languagesinverse homomorphismtheorem of varieties

Mathematics Subject Classification ID

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

Related Items (5)

A game theoretical approach to the algebraic counterpart of the Wagner hierarchy : Part I ⋮ Series formelles et algèbres syntactiques ⋮ The Algebraic Counterpart of the Wagner Hierarchy ⋮ Binary systems all subsets of which are recognizable ⋮ Sur une propriété d'itération des langages algébriques déterministes

Cites Work

• Syntaktische Monoide und Hypercodes
• On some properties of the free monoids with applications to automata theory
• The syntactic monoid of a hypercode
• On finite monoids having only trivial subgroups
• Quotients of Context-Free Languages
• Algebraic Theory of Machines. I. Prime Decomposition Theorem for Finite Semigroups and Machines
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Monoides pointes