Formal properties of finite automata and applications. LITP Spring school on theoretical computer science, Ramatuelle, France, May 23-27, 1988. Proceedings

zbMath0702.68024MaRDI QIDQ1801316

No author found.

Publication date: 5 June 1993

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

zbMATH Keywords

ProceedingssemigroupsApplicationsfinite automataregular languageswreath productstar heightFinite AutomataFormal propertiespolysequential functionsRamatuelle (France)

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Proceedings, conferences, collections, etc. pertaining to computer science (68-06) Algebraic theory of languages and automata (68Q70) Semigroups in automata theory, linguistics, etc. (20M35)

Related Items (3)

On the continuity set of an Omega rational function ⋮ Fuzzy homomorphisms of algebras ⋮ Cayley graphs as classifiers for data mining: the influence of asymmetries

This page was built for publication: Formal properties of finite automata and applications. LITP Spring school on theoretical computer science, Ramatuelle, France, May 23-27, 1988. Proceedings