可判定性
数学证明
介绍(产科)
自动机
形式语言
计算机科学
章节(排版)
域代数上的
自动机理论
程序设计语言
数学
牙石(牙科)
理论计算机科学
纯数学
放射科
操作系统
牙科
医学
几何学
作者
Laurent Bartholdi,Pedro V. Silva
出处
期刊:Le Centre pour la Communication Scientifique Directe - HAL - Inria
日期:2010-12-07
被引量:5
摘要
This text is devoted to the theory of varieties, which provides an important tool, based in universal algebra, for the classification of regular languages. In the introductory section, we present a number of examples that illustrate and motivate the fundamental concepts. We do this for the most part without proofs, and often without precise definitions, leaving these to the formal development of the theory that begins in Section 2. Our presentation of the theory draws heavily on the work of Gehrke, Grigorieff and Pin (2008) on the equational theory of lattices of regular languages. In the subsequent sections we consider in more detail aspects of varieties that were only briefly evoked in the introduction: Decidability, operations on languages, and characterizations in formal logic.
科研通智能强力驱动
Strongly Powered by AbleSci AI