The Infinite 2-Star Height Hierarchy of Extended Regular Languages of Star Degree at Most Two
نویسندگان
چکیده
منابع مشابه
The solution of two star height problems for regular trees
Regular trees can he detined by two types of rational exprwions. For these two types w;isolve the star-height problem, i.e., we show how to construct a rational expression of minimal star-height from the minimal graph of the given tree (i.e., the analogue of the minimal deterministic automaton for regular languages). In one case, the minimal starheight is the rank (in the Sense of Eggan) of the...
متن کاملThe Star Height Hierarchy Vs. The Variable Hierarchy
The star height hierarchy (resp. the variable hierarchy) results in classifying μ-terms into classes according to the nested depth of fixed point operators (resp. to the number of bound variables). We prove, under some assumptions, that the variable hierarchy is a proper refinement of the star height hierarchy. We mean that the non collapse of the variable hierarchy implies the non collapse of ...
متن کامل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 words, in this paper we consider the languages on infinite words.
متن کاملOn the star height of unary regular behaviours
We prove that for each integer n there is a regular expression over a singleton alphabet which is not bisimilar to any regular expression of star height less than n, thus positively answering a long-standing question of Robin Milner.
متن کاملSpider Diagrams of Order and a Hierarchy of Star-Free Regular Languages
The spider diagram logic forms a fragment of constraint diagram logic and is designed to be primarily used as a diagrammatic software specification tool. Our interest is in using the logical basis of spider diagrams and the existing known equivalences between certain logics, formal language theory classes and some automata to inform the development of diagrammatic logic. Such developments could...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Computation
سال: 1994
ISSN: 0890-5401
DOI: 10.1006/inco.1994.1087