Tom Head

Affiliations:
  • Binghamton University, Vestal, NY, USA


According to our database1, Tom Head authored at least 49 papers between 1977 and 2011.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2011
Computing transparently: the independent sets in a graph.
Nat. Comput., 2011

Computing with Light: toward Parallel Boolean Algebra.
Int. J. Found. Comput. Sci., 2011

How the Structure of DNA Molecules Provides Tools for Computation.
Proceedings of the Biology, Computation and Linguistics - New Interdisciplinary Paradigms, 2011

2010
Using Light to Implement Parallel Boolean Algebra.
Proceedings of the Developments in Language Theory, 14th International Conference, 2010

2009
Parallel Computing by Xeroxing on Transparencies.
Proceedings of the Algorithmic Bioprocesses, 2009

2007
Photocomputing: Explorations with Transparency and Opacity.
Parallel Process. Lett., 2007

A Cosmic Muse.
Proceedings of the Formal Models, 2007

2006
Splicing and Regularity.
Proceedings of the Recent Advances in Formal Languages and Applications, 2006

Aqueous Computing: Writing on Molecules Dissolved in Water.
Proceedings of the Nanotechnology: Science and Computation, 2006

2005
Protein output for DNA computing.
Nat. Comput., 2005

Does Light Direct Life Toward Cosmic Awareness?
Fundam. Informaticae, 2005

2002
Biomolecular Computing - Preface.
New Gener. Comput., 2002

Aqueous Computing: A Survey with an Invitation to Participate.
J. Comput. Sci. Technol., 2002

Splicing Systems: Regularity and Below.
Proceedings of the DNA Computing, 8th International Workshop on DNA Based Computers, 2002

An Aqueous Algorithm for Finding the Bijections Contained in a Binary Relation.
Proceedings of the Formal and Natural Computing, 2002

2001
Biomolecular Realizations of a Parallel Architecture for Solving Combinatorial Problems.
New Gener. Comput., 2001

Aqueous Computing: Writing into Fluid Memory.
Bull. EATCS, 2001

Aqueous Solutions of Algorithmic Problems: Emphasizing Knights on a 3 x 3.
Proceedings of the DNA Computing, 7th International Workshop on DNA-Based Computers, 2001

Writing by methylation proposed for aqueous computing.
Proceedings of the Where Mathematics, 2001

Visualizing Languages Using Primitive Powers.
Proceedings of the Words, Semigroups, and Transductions, 2001

2000
Splicing Systems, Aqueous Computing, and Beyond.
Proceedings of the Unconventional Models of Computation, 2000

Relativized Code Concepts and Multi-Tube DNA Dictionaries.
Proceedings of the Finite Versus Infinite, 2000

1999
Foreword.
J. Comb. Optim., 1999

Aqueous computing: writing on molecules.
Proceedings of the 1999 Congress on Evolutionary Computation, 1999

1998
Splicing Representations of Strictly Locally Testable Languages.
Discret. Appl. Math., 1998

Locality, Reversibility, and Beyond: Learning Languages from Positive Data.
Proceedings of the Algorithmic Learning Theory, 9th International Conference, 1998

1996
The finest homophonic partition and related code concepts.
IEEE Trans. Inf. Theory, 1996

1995
Deciding multiset decipherability.
IEEE Trans. Inf. Theory, 1995

1992
The lattice of semiretracts of a free monoid.
Int. J. Comput. Math., 1992

1991
The topologies of sofic subshifts have computable Pierce invariants.
RAIRO Theor. Informatics Appl., 1991

1990
The Set of Strings Mapped Into a Submonoid by Iterates of a Morphism.
Theor. Comput. Sci., 1990

The poset of retracts of a free monoid.
Int. J. Comput. Math., 1990

1989
Deciding the Immutability of Regular Codes and Languages Under Finite Transductions.
Inf. Process. Lett., 1989

One-Dimensional Cellular Automata: Injectivity From Unambiguity.
Complex Syst., 1989

1987
Bounded D0L Languages.
Theor. Comput. Sci., 1987

1986
Regularity of Sets of Initial Strings of Periodic D0L-Systems.
Theor. Comput. Sci., 1986

Periodic D0L Languages.
Theor. Comput. Sci., 1986

The Topological Structure of Adherences of Regular Languages.
RAIRO Theor. Informatics Appl., 1986

1985
Code Properties and Homomorphisms of D0L Systems.
Theor. Comput. Sci., 1985

1984
Adherences of D0L Languages.
Theor. Comput. Sci., 1984

Adherence Equivalence Is Decidable for DOL Languages.
Proceedings of the STACS 84, 1984

The adherences of languages as topological spaces.
Proceedings of the Automata on Infinite Words, 1984

1983
DOL Schemes and the Periodicity of String Embeddings.
Theor. Comput. Sci., 1983

1982
Finite DOL Languages and Codes.
Theor. Comput. Sci., 1982

1980
Hypercodes in Deterministic and Slender 0L Languages
Inf. Control., June, 1980

A-Transducers and the Monotonicity of IL Schemes.
J. Comput. Syst. Sci., 1980

1979
Codeterministic Lindenmayer Schemes and Systems.
J. Comput. Syst. Sci., 1979

The Decidability of Equivalence for Deterministic Finite Transducers.
J. Comput. Syst. Sci., 1979

1977
Automata That Recognize Intersections of Free Submonoids
Inf. Control., November, 1977


  Loading...