Quasi-star-free languages on infinite words

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...

Teljes leírás

Elmentve itt :
Bibliográfiai részletek
Szerző: Wu Zhilin
Dokumentumtípus: Cikk
Megjelent: 2005
Sorozat:Acta cybernetica 17 No. 1
Kulcsszavak:Számítástechnika, Kibernetika
Tárgyszavak:
Online Access:http://acta.bibl.u-szeged.hu/12754
Leíró adatok
Tartalmi kivonat: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.
Terjedelem/Fizikai jellemzők:75-93
ISSN:0324-721X