Total views : 92
Finite State Stack Transducer for Functionality in a Multi-Parameter Environment
Objective: This paper introduces and implements Finite-State-Stack-Transducer (FSST), an enhancement of the Finite-State-Transducer (FST) automaton. FSST is an automaton equipped with a stack to maintain the subjective memory suitable for an application. Analysis: Based on the 2-tape FST, the FSST employs this memory stack to select a suitable input alphabet for transition of state according to additional parameters, thus improving its responsiveness to a wider range of inputs. Findings: In this paper, we implement this model in a multi-state environment of a virtual agent to present its mood changes according to type and relevance of input statements. We also prove its utility for modeling conversational virtual agents for interactive environments. Applications: The presented FSST can be employed to improve the emotional reaction of the virtual agents. This improvement can be utilized to enhance the design and response of cognitive agents and automated virtual assistants.
Agent, Automata, Stack, Tape, Transducer
- Hopcroft JE, Motwani R, Ullman JD. Introduction to Automata Theory, Languages, and Computation. 2nd Ed.Pearson Education: USA; 2008. PMid:18676144
- Wright DR. Finite State Machines. CSC215 Class Notes. N.Carolina State University. 2005, p. 6–28.
- Keller RM. Classifiers, Acceptors, Transducers and Sequencers. Computer Science: Abstraction to Implementation. Harvey Mudd College; 2001. p. 472−85.
- Jurafsky D, Martin JH. Morphology and Finite State Transducers. In: Speech and Language Processing. Prentice Hall: New Jersey; 2000. p. 57–79.
- Kiraz GA, Evans EG. Multi-tape Automata for Speech and Language Systems: A Prolog Implementation. Proceedings WIA ‘97, Revised Papers from the Second International Workshop on Implementing Automata, Springer-Verlag London; 1998. p. 87−103. Crossref.
- Finite State Machine. Date Accessed: 29/09/2016. Crossref.
- Pushdown Transducer. Date Accessed: 29/09/2016.Crossref.
- Furia CA. A Survey of Multi-Tape Automata. Formal Languages and Automata Theory, 2012. Crossref
- There are currently no refbacks.
This work is licensed under a Creative Commons Attribution 3.0 License.