PaperPulse logo
FeedTopicsAI Researcher FeedBlogPodcastAccount

Stay Updated

Get the latest research delivered to your inbox

Platform

  • Home
  • About Us
  • Search Papers
  • Research Topics
  • Researcher Feed

Resources

  • Newsletter
  • Blog
  • Podcast
PaperPulse•

AI-powered research discovery platform

© 2024 PaperPulse. All rights reserved.

Codified Finite-state Machines for Role-playing

ArXivSource

Letian Peng, Yupeng Hou, Kun Zhou, Jingbo Shang

cs.CL
|
Feb 5, 2026
28 views

One-line Summary

The paper introduces Codified Finite-State Machines (CFSMs) and their probabilistic extension (CPFSMs) to improve character state modeling in role-playing with large language models, enhancing consistency and engagement by automatically generating state transitions from character profiles.

Plain-language Overview

Role-playing with large language models can be inconsistent because these models often focus on visible actions without understanding the deeper character states that drive interactions. The authors propose a new approach called Codified Finite-State Machines (CFSMs) to address this issue. CFSMs automatically create a structured model of character states and transitions from textual character profiles, ensuring more consistent behavior. Additionally, they introduce a probabilistic version, CPFSMs, to handle uncertainty and variability in character interactions. This method has been shown to outperform traditional approaches in both controlled and open-ended role-playing scenarios.

Technical Details