The following pages link to (Q5840116):
Displaying 11 items.
- On the size of inverse semigroups given by generators (Q627176) (← links)
- On deterministic finite automata and syntactic monoid size (Q703576) (← links)
- Computation on binary tree-networks (Q1082077) (← links)
- An algorithm for computation of translation invariant groups and the subgroup lattice (Q1394289) (← links)
- Computation of Boolean functions on networks of binary automata (Q1838457) (← links)
- Composition sequences for functions over a finite domain. (Q1853744) (← links)
- Composition Sequences and Synchronizing Automata (Q2891329) (← links)
- Minimal Reaction Systems Defining Subset Functions (Q2944907) (← links)
- Tight Bounds for Cut-Operations on Deterministic Finite Automata (Q2945878) (← links)
- Compositions of Functions and Permutations Specified by Minimal Reaction Systems (Q5384527) (← links)
- Some generalized sheffer functions (Q5545941) (← links)
