Incremental construction of minimal acyclic finite-state automata
Jan Daciuk, Stoyan Mihov, Bruce Watson, Richard Watson
Abstract
In this paper, we describe a new method for constructing minimal, deterministic, acyclic finite-state automata from a set of strings. Traditional methods consist of two phases: the first to construct a trie, the second one to minimize it. Our approach is to construct a minimal automaton in a single phase by adding new strings one by one and minimizing the resulting automaton on-the-fly. We present a general algorithm as well as a specialization that relies upon the lexicographical ordering of the input strings.
Create a lesson
Related papers
MixLID: Token-Level Language Identification in Mixed-Language Text
Seongtae Hong, Youngjoon Jang, Seungyoon Lee et al.
Know Yourself and Know Your Neighbour: A Syntactically Informed Self-Supervised Compositional Sentence Representation Learning Framework using a Recursive Hypernetwork
Vasudevan Nedumpozhimana, John Kelleher
PatTransBench: an ipc-stratified, multi-dimensional benchmark for patent machine translation evaluation
Xiaowei Su, Xusen Cheng
Spectral-Driven Adaptive-Rank Optimizer for Large Language Model Reinforcement Learning with Verifiable Rewards
Zhipeng Chen, Wayne Xin Zhao, Ji-Rong Wen
Support or Magnitude? Characterizing Neuron Relevance for Instruction Data Selection
Yifan Le
Intent-Triggered Anchoring for Multi-Token Format Units in Parallel Decoding of Diffusion Language Models
Junhyeok Lee, Kyu Sung Choi