A finite automaton can be either deterministic (DFA) or nondeterministic (NFA). An automaton-based task is in general more efficient when performed with a DFA rather than an NFA. For any NFA there equivalent that generated by the classical Subset Construction algorithm. When, however, large may transformed into series of actions operating directly on NFA, unnecessarily expensive computation, as...

This paper describes, within the context of the DARPA EARS program, the design and implementation of the Fisher protocol for collecting conversational telephone speech which has yielded more than 16,000 English conversations. It also discusses the Quick Transcription specification that allowed 2000 hours of Fisher audio to be transcribed in less than one year. Fisher data is already in use with...

We explore an equilibrium model of games where behavior is given by logit response functions, but payoff responsiveness and beliefs about others’ responsiveness are heterogeneous. We study two substantively different ways of extending quantal response equilibrium (QRE) to this setting: (1) Heterogeneus QRE, where players share identical correct beliefs about the distribution of payoff responsiv...