Tom Head Visualizing Languages Using Primitive Powers. [Citation Graph (0, 0)][DBLP] Words, Semigroups, and Transductions, 2001, pp:169-180 [Conf]
Tom Head An Aqueous Algorithm for Finding the Bijections Contained in a Binary Relation. [Citation Graph (0, 0)][DBLP] Formal and Natural Computing, 2002, pp:354-360 [Conf]
Tom Head Deciding the Immutability of Regular Codes and Languages Under Finite Transductions. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1989, v:31, n:5, pp:239-241 [Journal]
Tom Head The Topological Structure of Adherences of Regular Languages. [Citation Graph (0, 0)][DBLP] ITA, 1986, v:20, n:1, pp:31-41 [Journal]
Tom Head The topologies of sofic subshifts have computable Pierce invariants. [Citation Graph (0, 0)][DBLP] ITA, 1991, v:25, n:, pp:247-254 [Journal]
Tom Head Biomolecular Realizations of a Parallel Architecture for Solving Combinatorial Problems. [Citation Graph (0, 0)][DBLP] New Generation Comput., 2001, v:19, n:4, pp:301-312 [Journal]
Tom Head The Set of Strings Mapped Into a Submonoid by Iterates of a Morphism. [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 1990, v:73, n:3, pp:329-333 [Journal]
Andreas Weber, Tom Head The finest homophonic partition and related code concepts. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1996, v:42, n:5, pp:1569-1575 [Journal]
Using Light to Implement Parallel Boolean Algebra. [Citation Graph (, )][DBLP]
Aqueous Computing: Writing on Molecules Dissolved in Water. [Citation Graph (, )][DBLP]
Search in 0.025secs, Finished in 0.026secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP