Finite-memory automata

Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science Pub Date : 1990-10-22 DOI:10.1109/FSCS.1990.89590

M. Kaminski, N. Francez

引用次数: 422

Abstract

A model of computation dealing with infinite alphabets is proposed. The model is based on replacing the equality test by unification. It appears to be a natural generalization of the classical Rabin-Scott finite-state automata and possesses many of their properties.<>

查看原文本刊更多论文

有限记忆自动机

提出了一种处理无限字母的计算模型。该模型以统一检验代替等式检验为基础。它似乎是经典的Rabin-Scott有限状态自动机的自然推广，并具有它们的许多性质

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

求助全文

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

来源期刊

Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science

自引率

0.00%

发文量