scientific article; zbMATH DE number 4051013

MaRDI QIDQ3787499zbMATH OpenFDO

Authors G. P. Agibalov, N. Evtushenko

Publication date 1986

zbMATH Keywords

cascadedecompositionparallel reducibility of automatasemigroup

Mathematics Subject Classification ID

Semigroups in automata theory, linguistics, etc. (20M35) Algebraic theory of languages and automata (68Q70)

Cited in

(11)

• Minimality of an automaton cascade decomposition for learning system environments
• On constructing and visualizing cascaded automata
• Surjections and coverings
• scientific article; zbMATH DE number 3940736 (Why is no real title available?)
• scientific article; zbMATH DE number 4047131 (Why is no real title available?)
• scientific article; zbMATH DE number 3577162 (Why is no real title available?)
• Loop-free compositions of certain finite automata. II
• Yet another proof of the cascade decomposition theorem for finite automata: Correction
• Implementation and Application of Automata
• Sufficient conditions of deterministic implementation of finite-state automata with retention of the numbers of their states
• Branching automata with costs -- a way of reflecting parallelism in costs

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