Abstract
The DLI-sets were defined in connection with the problem of deciding the context-freeness of the languages Q n = Q ∩ (ab *)n} [14]. It is conjectured in [3] that Q n is context-free for all positive numbers n. This conjecture was verified for the cases where \( n = p_1^{f_1 } ... p_k^{f_k } \) with distinct prime numbers p 1,...,p k for which
. (1) holds. (See.: [18]). To find a proof for the general case it would be useful to find special DLI sets other then the boxes used in the proof of the former result. In this paper a sufficient condition is given for DLI sets to be stratified semilinear
This research was supported by the Hungarian-German scientific- technological research project No D 39/2000 in the scope of the treaty contracted by the Hungarian Ministry of Education and his German contractual partner BMBF.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
J. Dassow and Gh. Păun. Regulated Rewriting in Formal Language Theory, volume 18 of EATCS Monographs in Theoretical Computer Science. Springer, Berlin, 1989.
P. Dömösi, S. Horváth, M. Ito, L. Kászonyi, and M. Katsura. Some combinatorial properties of words, and the = Chomsky-hierarchy. In Proceedings of the 2nd International Colloquium on = Words, Languages and Combinatorics, Kyoto, Japan, 1992. World Scientific, Singapore.
P. Dömösi, S. Horváth, M. Ito, L. Kászonyi, and M. Katsura. Formal languages consisting of primitive words. In: Z. Ésik, editor, Proceedings of the 9th = International Conference on Fundamentals of Computation Theory, number 710 in LNCS, = pages 194–203, Szeged, Hungary, 1993. Springer.
S. Ginsburg. The Mathematical Theory of Context-Free Languages. McGraw-Hill, New York, 1966.
M. Ito and M. Katsura. Context-free languages consisting of non-primitive words. International Journal on Computer Mathematics, = 40:157–167, 1991.
H. Petersen. The Ambiguity of Primitive Words, STACS’94
Gh. Păun. Morphisms and Primitivity. EATCS Bulletin, Technical Contributions, 1997 85–88.
A. Salomaa. From Parikh vectors to GO territories. EATCS Bulletin, Formal Language Column 1995 89–95.
J. Berstel and L. Boasson. The set of Lyndon words is not context-free EATCS Bulletin, Technical Conributions, 63 1997 = 139–140.
L. Kászonyi. On a class of stratified linear sets. Pure Mathematics and Applications, Ser. A, = 6(2):203–210, 1995.
L. Kászonyi and M. Holzer. A generalization of the flip-flop lemma AFL’96, Salgótarján (1996) Publ. Math. Debrecen 54 (1999) suppl., 203–210.
L. Kászonyi. On bounded context-free languages In: T. Imaoka and C. Nehaniv, editors, Proceedings of the First Symposium on Algebra, Languages and Computation University of Aizu, 1997. Japan
L. Kászonyi. On DLI-sets of Katsura type. AFL’2002, Debrecen, submitted.
L. Kászonyi. A pumping lemma for DLI-languages Discrete Mathematics 258 (2002) 105–122.
L. Kászonyi. How to generate binary codes using context-free grammars. In: M. Ito, G. Paun, Sheng Yu, editors, Words, Semigroups, Transductions, Festschrift in Honor of Gabriel Thierrin World Scientific, 289–301, 2001.
L. Kászonyi and M. Katsura. On an algorithm concerning the languages Q∩(ab *)n.PU.M.A (Pure and Applied Mathematics.) 10(3):313–322, 1999.
L. Kászonyi and M. Katsura. On the context-freeness of a class of primitive words. Publ. Math. Debrecen 51 (1997) 1–11.
L. Kászonyi and M. Katsura. Some new results on the context-freeness of languages Q∩(ab *)n. In: Proc. of the 8th Conf. Automata and Formal Languages (AFL’96), Salgótarján, Hungary, 29 Juli–2 August. Publ. Math. Debrecen, 54 885–894, 1999.
A. Mateescu, Gh. Păun, G. Rozenberg, and A. Salomaa. Parikh prime words and GO-like territories. Journal of of Universal Computer Science, = 1(12):790–810, 1995.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kászonyi, L. (2003). On the Structure of Graphic DLI-Sets. In: Ito, M., Toyama, M. (eds) Developments in Language Theory. DLT 2002. Lecture Notes in Computer Science, vol 2450. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45005-X_31
Download citation
DOI: https://doi.org/10.1007/3-540-45005-X_31
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40431-6
Online ISBN: 978-3-540-45005-4
eBook Packages: Springer Book Archive