The following pages link to Thomas N. Hibbard (Q1141476):
Displaying 26 items.
- (Q732362) (redirect page) (← links)
- (Q1392955) (redirect page) (← links)
- (Q2395864) (redirect page) (← links)
- An algorithm for testing permutativeness of cellular automata (Q732363) (← links)
- Orthogonality of information structures (Q1141477) (← links)
- On the formal definition of dependencies between the control and information structure of a data space (Q1242666) (← links)
- Functional behavior in data spaces (Q1244988) (← links)
- Local area networks as supercomputers (Q1392956) (← links)
- Sequences in context free languages (Q2395865) (← links)
- (Q3674060) (← links)
- (Q3771593) (← links)
- An empirical study of minimal storage sorting (Q3849244) (← links)
- Context-Limited Grammars (Q4042666) (← links)
- (Q4101414) (← links)
- (Q4121392) (← links)
- (Q4160417) (← links)
- Formal Modeling of Virtual Machines (Q4166187) (← links)
- Data spaces with indirect addressing (Q4174206) (← links)
- (Q4190136) (← links)
- (Q4195924) (← links)
- (Q5184375) (← links)
- The Independence of Inherent Ambiguity From Complementedness Among Context-Free Languages (Q5534925) (← links)
- Least Upper Bounds on Minimal Terminal State Experiments for Two Classes of Sequential Machines (Q5535949) (← links)
- Least Upper Bounds on Minimal Terminal State Experiments for Two Classes of Sequential Machines (Q5540450) (← links)
- A generalization of context-free determinism (Q5554975) (← links)
- (Q5586368) (← links)
- A Simple Sorting Algorithm (Q5721419) (← links)
- Some Combinatorial Properties of Certain Trees With Applications to Searching and Sorting (Q5725054) (← links)
