The following pages link to (Q2776607):
Displaying 15 items.
- STATE COMPLEXITY OF TWO COMBINED OPERATIONS: CATENATION-STAR AND CATENATION-REVERSAL (Q2909180) (← links)
- FORMAL DESCRIPTIONS OF CODE PROPERTIES: DECIDABILITY, COMPLEXITY, IMPLEMENTATION (Q2909182) (← links)
- A class of simple<i>C</i><sup>*</sup>-algebras arising from certain non-sofic subshifts (Q3002598) (← links)
- ORTHOGONAL SHUFFLE ON TRAJECTORIES (Q3076614) (← links)
- THE FINITE TILING PROBLEM IS UNDECIDABLE IN THE HYPERBOLIC PLANE (Q3526546) (← links)
- On the operating unit size of load/store architectures (Q3564342) (← links)
- Nonlinear phenomena in spaces of algorithms (Q4467341) (← links)
- Signed real measure of regular languages for discrete-event automata (Q4668241) (← links)
- One-Time Nondeterministic Computations (Q5205043) (← links)
- Nature computes: Information processing in quantum dynamical systems (Q5251244) (← links)
- A geometric approach to complexity (Q5264340) (← links)
- STAR-FREE GEODESIC LANGUAGES FOR GROUPS (Q5297788) (← links)
- Maurer computers for pipelined instruction processing (Q5458071) (← links)
- CONFLICTS AND FAIR TESTING (Q5484903) (← links)
- BOND-FREE LANGUAGES: FORMALIZATIONS, MAXIMALITY AND CONSTRUCTION METHODS (Q5704382) (← links)
