对“论确定性有限自动机中的状态可观测性”一文中若干问题的解答
Answers to Questions Formulated in the Paper "On States Observability in Deterministic Finite Automata"
摘要：
本文回答了A. Mateescu和Gh.潘具体地说，它表明，对于所有的k >= 2，家庭的正则语言可接受的确定性有限自动机不超过k个半可观察的状态，表示为Tk，是反AFL的，和家庭T1不同的封闭性下Kleene +。
英文摘要：
This paper gives answers to questions formulated as open in the paper "On State Observability in Deterministic Finite Automata" by A. Mateescu and Gh. Paun. Specifically, it demonstrates that for all k >= 2, the families of regular languages acceptable by deterministic finite automata with no more than k semi-observable states, denoted by Tk, are anti-AFL's, and that the family T1 differs in the closure property under Kleene +.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
