Handbook of theoretical computer science (vol. B)
The theory of semirings with applications in mathematics and theoretical computer science
The theory of semirings with applications in mathematics and theoretical computer science
Theoretical Computer Science
Long words: the theory of concatenation and &ohgr;-power
Theoretical Computer Science
Automata, Languages, and Machines
Automata, Languages, and Machines
Context-Free Sets of Infinite Words
Proceedings of the 4th GI-Conference on Theoretical Computer Science
Automatic linear orders and trees
ACM Transactions on Computational Logic (TOCL)
Journal of Computer and System Sciences
Infinite sequences and finite machines
SWCT '63 Proceedings of the 1963 Proceedings of the Fourth Annual Symposium on Switching Circuit Theory and Logical Design
The equational theory of regular words
Information and Computation
A characterization of context-free languages
Journal of Computer and System Sciences
Regular and algebraic words and ordinals
CALCO'07 Proceedings of the 2nd international conference on Algebra and coalgebra in computer science
Logic and rational languages of words indexed by linear orderings
CSR'08 Proceedings of the 3rd international conference on Computer science: theory and applications
Fundamenta Informaticae
On Müller context-free grammars
DLT'10 Proceedings of the 14th international conference on Developments in language theory
An undecidable property of context-free linear orders
Information Processing Letters
Theoretical Computer Science
Isomorphism of regular trees and words
ICALP'11 Proceedings of the 38th international conference on Automata, languages and programming - Volume Part II
Scattered context-free linear orderings
DLT'11 Proceedings of the 15th international conference on Developments in language theory
A kleene theorem for languages of words indexed by linear orderings
DLT'05 Proceedings of the 9th international conference on Developments in Language Theory
| Hi-index | 0.00 |
It is known that if a Büchi context-free language (BCFL) consists of scattered words, then there is an integer n, depending only on the language, such that the Hausdorff rank of each word in the language is bounded by n. Every BCFL is a Muller context-free language (MCFL). In the first part of the paper, we prove that an MCFL of scattered words is a BCFL iff the rank of every word in the language is bounded by an integer depending only on the language. Then we establish operational characterizations of the BCFLs of well-ordered and scattered or well-ordered words.