scientific article; zbMATH DE number 1047941

MaRDI QIDQ4348022zbMATH OpenFDO

Authors Robert Oehmke

Publication date 9 February 1998

zbMATH Keywords

\(S\)-automatasemigroupssemisimplicity of automataunitary automata

Mathematics Subject Classification ID

Subalgebras, congruence relations (08A30) Semigroups in automata theory, linguistics, etc. (20M35) Algebraic theory of languages and automata (68Q70)

Recommendations

• Automata with finite congruence lattices
• Semigroups over which no automaton has proper essential congruences
• A class of semisimple automata
• scientific article; zbMATH DE number 3927237
• scientific article; zbMATH DE number 1370347

Cited in

(12)

• On congruences of automata defined by directed graphs
• Cerny's conjecture for automata with simple idempotents
• scientific article; zbMATH DE number 4064500 (Why is no real title available?)
• scientific article; zbMATH DE number 179004 (Why is no real title available?)
• scientific article; zbMATH DE number 1254099 (Why is no real title available?)
• scientific article; zbMATH DE number 1354849 (Why is no real title available?)
• scientific article; zbMATH DE number 1484314 (Why is no real title available?)
• scientific article; zbMATH DE number 1370347 (Why is no real title available?)
• scientific article; zbMATH DE number 3995061 (Why is no real title available?)
• A case study in meta-automation: automatic generation of congruence automata for combinatorial sequences
• Automata with finite congruence lattices
• From Nerode's congruence to suffix automata with mismatches

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4348022)