scientific article; zbMATH DE number 17309

MaRDI QIDQ3974006zbMATH OpenFDO

Authors Gerard Lallement

Publication date 26 June 1992

zbMATH Keywords

computational complexityautomataBoolean circuitssemigroupslanguagesnon-deterministic finite automata

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Algebraic theory of languages and automata (68Q70) Semigroups in automata theory, linguistics, etc. (20M35)

Recommendations

• Finite semigroup varieties defined by programs
• Extensions to Barrington's M-program model
• The power of programs over monoids in DA
• scientific article; zbMATH DE number 1916674
• Programs over semigroups of dot-depth one

Cited in

(6)

• CONSTANT-DEPTH PERIODIC CIRCUITS
• Extensions to Barrington's M-program model
• Programs over semigroups of dot-depth one
• scientific article; zbMATH DE number 4033093 (Why is no real title available?)
• scientific article; zbMATH DE number 1916674 (Why is no real title available?)
• scientific article; zbMATH DE number 1962825 (Why is no real title available?)

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 Q3974006)