Quasi-star-free languages on infinite words

Authors

  • Zhilin Wu

Abstract

Quasi-star-free languages were first introduced and studied by Barrington, Compton, Straubing and Thérien within the context of circuit complexity in 1992, and their connections with propositional linear temporal logic were established by Ésik and Ito recently. While these results are all for finite words, in this paper we consider the languages on infinite words.

Downloads

Download data is not yet available.

Downloads

Published

2005-01-01

How to Cite

Wu, Z. (2005). Quasi-star-free languages on infinite words. Acta Cybernetica, 17(1), 75–93. Retrieved from https://cyber.bibl.u-szeged.hu/index.php/actcybern/article/view/3655

Issue

Section

Regular articles