Sur les automates qui reconnaissent une famille de langages. (On the automata which accept a family of languages)

DOI10.1007/BF02573305zbMath0678.20043OpenAlexW1974721692MaRDI QIDQ1123986

Jean-Claude Spehner

Publication date: 1989

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

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

zbMATH Keywords

finite automataregular languagessyntactic monoidfinite monoidstate sets

Mathematics Subject Classification ID

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

Related Items (1)

La reconnaissance des facteurs d'un langage fini dans un texte en temps linéaire. (Recognition of the factors of a finite language in a text in linear time)

Cites Work

• La reconnaissance des facteurs d'un langage fini dans un texte en temps linéaire. (Recognition of the factors of a finite language in a text in linear time)
• A Characterization of Machine Mappings
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Sur les automates qui reconnaissent une famille de langages. (On the automata which accept a family of languages)