Algebraic constraints, automata, and regular languages

被引：0

作者：

Khoussainov, Bakhadyr ^{[1
]}

机构：

[1] Computer Science Department the University of Auckland, Auckland, New Zealand

来源：

Electronic Notes in Theoretical Computer Science | 2000年 / 31卷

关键词：

Algebra - Constraint theory - Context free grammars - Decision theory - Finite automata - Polynomials - Problem solving - Set theory;

D O I：

10.1016/S1571-0661(05)80333-0

中图分类号：

学科分类号：

摘要：

A class of decision problems is Boolean if it is closed under the set-theoretic operations of union, intersection and complementation. The paper introduces new Boolean classes of decision problems based on algebraic constraints imposed on transitions of finite automata. We discuss issues related to specifications of these classes from algebraic, computational and proof-theoretic points of view. ©2000 Published by Elsevier Science B.V.

引用

页码：104 / 117