#### Filter Results:

- Full text PDF available (4)

#### Publication Year

1966

2005

- This year (0)
- Last 5 years (0)
- Last 10 years (0)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- James W. Thatcher, Jesse B. Wright
- Mathematical systems theory
- 1968

Many of the important concepts and results of conventional finite automata theory are developed for a generalization in which finite algebras take the place of finite automata. The standard closure theorems are proved for the class of sets “recognizable” by finite algebras, and a generalization of Kleene's regularity theory is presented. The theorems of the… (More)

- Joseph A. Goguen, James W. Thatcher, Eric G. Wagner, Jesse B. Wright
- J. ACM
- 1977

Many apparently divergent approaches to specifying formal semantics of programming languages are applications of initial algebra semantics. In this paper an overview of initial algebra semantics is provided. The major technical feature is an initial continuous algebra which permits unified algebraic treatment of iterative and recursive semantic features in… (More)

- James W. Thatcher
- J. Comput. Syst. Sci.
- 1967

- James W. Thatcher
- J. Comput. Syst. Sci.
- 1970

- James W. Thatcher, Eric G. Wagner, Jesse B. Wright
- STOC
- 1978

This paper extends our earlier work on abstract data types by providing an algebraic treatment of parametrized data types (e.g., sets-of-(), stacks-of-(), etc.), as well as answering a number of questions on the power and limitations of algebraic specification techniques. In brief: we investigate the “hidden function” problem (the need to… (More)

- Hartmut Ehrig, Hans-Jörg Kreowski, James W. Thatcher, Eric G. Wagner, Jesse B. Wright
- Theor. Comput. Sci.
- 1981

In this paper NT study the semantics of the parameter passing mechanism in algebraic qwcilication Ianguagcs. ;Ilore precisely. this problem is studied for parameterizcd data types and ptmmeterized qxcilkations. The given results include the extension of the model functor (which ih uwfuI for corrwtness proofs) and the semantic properties of the result ot… (More)

- James W. Thatcher
- STOC
- 1969

The objective of this work is to expand the study of generalized finite automata theory by introducing generalized finite state mappings (finite state mappings of trees). In the process, we hope to provide an algebraic framework in which to study formalizations of transformations (in the sense that linguists use the term) and translations of natural and… (More)

- Matthew King, James W. Thatcher, Philip Matthew Bronstad, Robert Easton
- IBM Systems Journal
- 2005

M. King J. W. Thatcher P. M. Bronstad R. Easton The case for ensuring that Web sites are usable by people with disabilities is strong in light of the World Wide Web’s ubiquity as an essential customer interface for most organizations, the considerable disposable income of people with disabilities, and a growing number of accessibility regulations being… (More)

- Joseph A. Goguen, James W. Thatcher
- SWAT
- 1974

- Jesse B. Wright, Eric G. Wagner, James W. Thatcher
- Theor. Comput. Sci.
- 1977