Chains and Superchains for ω-Rational Sets, Automata and Semigroups-Reference-Cited by-同舟云学术

Chains and Superchains for ω-Rational Sets, Automata and Semigroups

Published:1997-12 Issue:06 Volume:07 Page:673-695
ISSN:0218-1967
Container-title:International Journal of Algebra and Computation
language:en
Short-container-title:Int. J. Algebra Comput.

Author:

Carton Olivier¹,Perrin Dominique¹

Affiliation:

1. Institut Gaspard Monge, Université de Marne-la-Vallée, 2, rue de la butte verte, 93166 Noisy le Grand Cedex, France

Abstract

We introduce several equivalent notions that generalize ones introduced by Klaus Wagner for finite Muller automata under the name of chains and superchains. We define such objects in relation to ω-rational sets, Muller automata or also ω-semigroups. We prove their equivalence and derive some basic properties of these objects. In a subsequent paper, we show how these concepts allow us to derive a new presentation of the hierarchy due to K. Wagner and W. Wadge.

Publisher

World Scientific Pub Co Pte Lt

Subject

General Mathematics

Link

https://www.worldscientific.com/doi/pdf/10.1142/S0218196797000290

Cited by 23 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Classifying $$\omega $$-Regular Aperiodic k-Partitions;Descriptional Complexity of Formal Systems;2020

2. A SURVEY ON DIFFERENCE HIERARCHIES OF REGULAR LANGUAGES;LOG METH COMPUT SCI;2018

3. Topological Complexity of Context-Free ω-Languages: A Survey;Lecture Notes in Computer Science;2014

4. The Wadge Hierarchy of Petri Nets ω-Languages;Logical Foundations of Computer Science;2013

5. A Game Theoretical Approach to The Algebraic Counterpart of The Wagner Hierarchy : Part II;RAIRO - Theoretical Informatics and Applications;2009-03-12