LNCS 2950 - Aspects of Molecular Computing (Frontmatter Pages)

386 Publications by Thomas J. Head
19. (with M. Blattner) Single valued a–transducers, J. Computer & System Sci.,
15 (1977), 310–327.
20. (with M. Blatner) Automata that recognize intersections of free monoids,
Information & Control, 35 (1977), 173–176.
21. Quotenet monoids and greatest commutative monoid images of several types,
Semigroup Forum, 17 (1979), 351–363.
22. (with M. Blattner) The decidability of equivalence for deterministic finite
transducers, J. Computer & System Sci., 19 (1979), 45–49.
23. Codes, languages, 0L schemes, and a–transducers, Soochow J. Math., 5
(1979), 45–62.
24. Codeterministic Lindenmayer schemes and systems, J. Computer & Systems
Sci., 19 (1979), 203–210.
25. A–transducers and the monotonicity of IL schemes, J. Computer & Systems
Sci., 21 (1980), 87–91.
26. (with J. Anderson) On injective and flat commutative regular semigroups
(short note), Semigroup Forum, 21 (1980), 283–284.
27. Unique decipherability relative to a language, Tamkang J. Math., 11 (1980),
59–66.
28. (with G. Thierrin) Hypercodes in deterministic and slender 0L languages,
Information & control, 45 (1980), 251–262.
29. Fixed languages and the adult languages of 0L schemes, Intern. J. Computer
Math., 10 (1981), 103–107.
30. Expanded subalphabets in the theories of languages and semigroups, Intern.
J. Computer. Math., 12 (1982), 113–123.
31. (with J. Wilkinson) Finite D0L languages and codes (note), Theoretical Computer
Science, 21 (1982), 357–361.
32. (with Culik II) Transductions and the parallel generation of languages, Intern.
J. Computer. Math., 13 (1983), 3–15.
33. (with G. Therrin, J. Wilkinson) D0L schemes and the periodicity of string
embeddings (note), Theoretical Computer Science, 23 (1983), 83–89.
34. (with G. Therrin) Polynomially bounded D0L systems yield codes, in Combinatorics
on Words: Progress and Perspectives (L.J. Cummings, ed.), Academic
Press, 1983, 167–174.
35. Adherences of D0L languages, Theoretical Computer Science, 31 (1984),
139–149.
36. Adherence equivalence is decidable for D0L languages, in Lecture Notes in
Computer Science 166 (M. Fontet, K. Melhorn, eds.), Springer–Verlag, 1984,
241–249.
37. (with J. Wilkinson) Code properties and homomorphisms of D0L systems,
Theoretical Comp. Sci., 35 (1985), 295–312.
38. (with J. Wilkinson) Code properties and derivatives of D0L systems, Combinatorial
Algorithms on Words (A. Apostolico & Z. Galil, eds.), Springer–
Verlag, 1985, 315–327.
39. The topological structure of adherences of regular languages R.A.I.R.O.
Theor. Informatics & Applications, 20 (1986), 31–41.