𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Automata in categories. The decomposition problem

✍ Scribed by N. L. Melikadze

Publisher
Springer US
Year
1981
Tongue
English
Weight
563 KB
Volume
16
Category
Article
ISSN
1573-8337

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

The decomposition of abstract automata
The decomposition of abstract automata
✍ A. N. Melikhov; L. S. Bershtein; V. P. Karelin πŸ“‚ Article πŸ“… 1972 πŸ› Springer US 🌐 English βš– 534 KB
Problem domain categories in requirement
Problem domain categories in requirements engineering
✍ N.A.M. MAIDEN; M. HARE πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 337 KB

Requirements engineering is the complex technical, social and cognitive process which produces requirements for a software-intensive system. However, little is understood about the problem domains for which these software-intensive systems are developed. Card sorting was used to determine mental cat

On Calculating the Krohn–Rhodes Decompos
On Calculating the Krohn–Rhodes Decomposition of Automata
✍ Sunil Talwar πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 336 KB

## DEDICATED TO M.-P. SCHUTZENBERGER The Krohn᎐Rhodes prime decomposition theorem determines the building blocks and their combination so as to mimic any given automaton. This result leads to an intuitively appealing, integer valued measure of the complexity of an automaton. It is a long-standing