Relations between equation automata and follow automata

IF 1 4区计算机科学 Q3 COMPUTER SCIENCE, THEORY & METHODS

Information and Computation Pub Date : 2025-08-12 DOI:10.1016/j.ic.2025.105333

Ping Lu , Haiming Chen

引用次数: 0

Abstract

This paper focuses on the relations between two small automata, i.e., the equation automaton and the follow automaton, which are both quotients of the position automaton. Ilie and Yu had pointed out that a rigorous analysis of their relations is necessary but difficult. We aim to tackle this problem. We first provide a sufficient condition for the equation automaton to be a quotient of the follow automaton, and then show that there exist different conditions under which the relations between these two automata vary.

查看原文本刊更多论文

方程自动机与跟随自动机的关系

本文研究了两个小自动机，即方程自动机和跟随自动机之间的关系，它们都是位置自动机的商。Ilie和Yu曾指出，对他们的关系进行严格的分析是必要的，但也是困难的。我们的目标是解决这个问题。首先给出了方程自动机是后自动机的商的充分条件，然后证明了这两个自动机之间的关系存在不同的变化条件。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

Information and Computation 工程技术-计算机：理论方法

CiteScore

2.30

自引率

0.00%

发文量

119

审稿时长

140 days

期刊介绍： Information and Computation welcomes original papers in all areas of theoretical computer science and computational applications of information theory. Survey articles of exceptional quality will also be considered. Particularly welcome are papers contributing new results in active theoretical areas such as -Biological computation and computational biology- Computational complexity- Computer theorem-proving- Concurrency and distributed process theory- Cryptographic theory- Data base theory- Decision problems in logic- Design and analysis of algorithms- Discrete optimization and mathematical programming- Inductive inference and learning theory- Logic & constraint programming- Program verification & model checking- Probabilistic & Quantum computation- Semantics of programming languages- Symbolic computation, lambda calculus, and rewriting systems- Types and typechecking