A note on the class of languages generated by F-systems over regular languages

A Short Note on Infinite Union/Intersection of Omega Regular Languages

We in this paper show that omega regular languages are not closed under infinite union and intersection. As an attempt, we propose to add step variables and quantifiers to temporal logics to enhance the expressiveness of the underlying logic. We also show that doing this would cause undecidability in satisfiability, even if for a rather limited fragment of temporal logic.

关于胞腔结构可判定性的一个注记

A note on decidability of cellularity

一个正则语言L称为细胞语言，如果存在一个1维细胞自动机CA，使得L是由与CA相关联的有限块组成的语言。它表明，一个正则语言的细胞是可判定的使用细胞语言的一个新的特征制定的Freiling，Goldstein和Moews和隐含的深刻结果Boyle在符号动力学。

关于可识别级数与正则序列及其最小线性表示之间关系的注记

A Note on the Relation between Recognisable Series and Regular Sequences, and their Minimal Linear Representations

本文通过线性表示精确建立了可识别级数与 $q$-正则序列之间的联系，并证明可识别级数的最小化算法同样适用于 $q$-正则序列的线性表示最小化。

关于非正则语言观测一致性的不可判定性注记

A Note on Undecidability of Observation Consistency for Non-Regular Languages

本文证明了对于非正则（线性、确定上下文无关）语言，观测一致性条件是不可判定的，而正则语言的可判定性仍为开放问题。