Multitape one-way nonwriting automata

Patrick C. Fischer; Arnold L. Rosenberg

doi:10.1016/S0022-0000(68)80006-6

Journal of Computer and System Sciences

Paper

01 Jun 1968

Multitape one-way nonwriting automata

View publication

Abstract

The theory given by Rabin and Scott for one-tape finite automata is extended to cover machines with several input tapes which can be advanced independently under finite-state control. © 1996 Academic Press, Inc.

Paper

Interactive scheduling as a constraint satisfiability problem

Ronen Feldman, Martin Charles Golumbic

Ann. Math. Artif. Intell.

Conference paper

EXAMPLES OF USING THE RESEARCH QUEUEING PACKAGE MODELING ENVIRONMENT (RESQME).

Robert F. Gordon, Edward A. MacNair, et al.

WSC 1985

Conference paper

Characterization of line width variation

Alfred K. Wong, Antoinette F. Molless, et al.

SPIE Advanced Lithography 2000

Paper

A remark on an algorithm for best L^p approximation

Charles Micchelli

Journal of Approximation Theory

View all publications

Abstract

Related

Interactive scheduling as a constraint satisfiability problem

EXAMPLES OF USING THE RESEARCH QUEUEING PACKAGE MODELING ENVIRONMENT (RESQME).

Characterization of line width variation

A remark on an algorithm for best Lp approximation

A remark on an algorithm for best L^p approximation