Skip to main content
SpringerLink
Log in

Conditional context-free languages of finite index

  • 1. Regulated Rewriting
  • Chapter
  • First Online:
New Trends in Formal Languages

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1218))

Abstract

We consider conditional context-free grammars that generate languages of finite index. Thereby, we solve an open problem stated in Dassow and Păun's monograph on regulated rewriting. Moreover, we show that conditional context-free languages with context-free conditions of finite index are more powerful than conditional context-free languages with regular conditions of finite index. Furthermore, we study the complexity of membership and non-emptiness for conditional and programmed languages respectively grammars (of finite index) with regular, linear, and context-free core rules and conditions.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. E. Altman and R. Banerji. Some problems of finite representability. Inf. Contr., 8:251–263, 1965.

    Google Scholar 

  2. J. Balcázar, J. Díaz, and J. Gabarró. Structural Complexity Theory I. Springer, 1988.

    Google Scholar 

  3. R. B. Banerji. Phrase structure languages, finite machines, and channel capacity. Inf. Contr., 6:153–162, 1963.

    Google Scholar 

  4. J. Beauquier. Deux familles de langages incomparables. Inf. Contr., 43:101–122, 1979.

    Google Scholar 

  5. B. Brainerd. An analog of a theorem about context-free languages. Inf. Contr., 11:561–567, 1968.

    Google Scholar 

  6. E. Csuhaj-Varjú, J. Dassow, J. Kelemen, and Gh. Păun. Grammar Systems: A Grammatical Approach to Distribution and Cooperation. London: Gordon and Breach, 1994.

    Google Scholar 

  7. J. Dassow and H. Hornig. Conditional grammars with subregular conditions. In 2nd International Colloquium on Words, Languages, and Combinatorics, pages 71–86. Kyoto Sangyo Unversity (Japan), World Scientific, August 1990.

    Google Scholar 

  8. J. Dassow and Gh. Păun. Regulated Rewriting in Formal Language Theory, volume 18 of EATCS Monographs in Theoretical Computer Science. Berlin: Springer, 1989.

    Google Scholar 

  9. G. Dong. On the index of positive programmed formal languages. IPL, 54:105–110, 1995.

    Google Scholar 

  10. D. Ferment. Principality results about some matrix language families. In J. Paredaens, editor, 11th ICALP'84, volume 172 of LNCS, pages 151–161, 1984.

    Google Scholar 

  11. H. Fernau, R. Freund, and M. Holzer. External versus internal hybridization for cooperating distributed grammar systems. Technical Report TR 185-2/FR-1/96, Technische Universität Wien (Austria), 1996.

    Google Scholar 

  12. H. Fernau and M. Holzer. Regulated finite index language families collapse. Technical Report WSI-96-16, Universität Tübingen (Germany), Wilhelm-Schickard-Institut für Informatik, 1996.

    Google Scholar 

  13. S. Ginsburg and E. H. Spanier. Finite-turn pushdown automata. SIAM Journal of Control, 4(3):429–453, 1966.

    Google Scholar 

  14. S. Ginsburg and E. H. Spanier. Derivation-bounded languages. JCSS, 2:228–250, 1968.

    Google Scholar 

  15. J. Gruska. A few remarks on the index of context-free grammars and languages. Inf. Contr., 19:216–223, 1971.

    Google Scholar 

  16. D. Hauschildt and M. Jantzen. Petri net algorithms in the theory of matrix grammars. Acta Informatica, 31:719–728, 1994.

    Google Scholar 

  17. N. Immerman. Nondeterministic space is closed under complementation. SIAM Journal Comput., 17(5):935–938, 1988.

    Google Scholar 

  18. N. D. Jones and W. T. Laaser. Complete problems for deterministic polynomial time. TCS, 3:105–117, 1977.

    Google Scholar 

  19. D. Kozen. Lower bounds for natural proof systems. In Proceedings of the 18th Annual Symposium on Foundations of Computer Science, pages 254–266, 1977.

    Google Scholar 

  20. M. Latteux and A. Terlutte. The Parikh-boundedness of ET0L languages of finite index. In G. Rozenberg and A. K. Salomaa, editors, The Book of L, pages 327–338. Berlin: Springer, 1985.

    Google Scholar 

  21. Gh. Păun. On the index of grammars and languages. Inf. Contr., 35:259–266, 1977.

    Google Scholar 

  22. Gh. Păun. On the family of finite index matrix languages. JCSS, 18(3):267–280, 1979.

    Google Scholar 

  23. Gh. Păun. On the generative capacity of conditional grammars. Inf. Contr., 43:178–186, 1979.

    Google Scholar 

  24. Gh. Păun. Some consequences of a result of Ehrenfeucht and Rozenberg. RAIRO Informatique théorique et Applications/Theoretical Informatics and Applications, 14(1):119–122, 1980.

    Google Scholar 

  25. Gh. Păun. Length-increasing grammars of finite index. Rev. Roumaine Math. Pures Appl., XXVIII(5):391–403, 1983.

    Google Scholar 

  26. Gh. Păun. Some context-free-like properties of finite index matrix languages. Bull. Math. de la Soc. Sci. Math. de Roumanie, 27(1):83–87, 1983.

    Google Scholar 

  27. V. Rajlich. Absolutely parallel grammars and two-way deterministic finite state transducers. JCSS, 6:324–342, 1972.

    Google Scholar 

  28. G. Rozenberg. More on ET0L systems versus random context grammars. IPL, 5(4):102–106, 1976.

    Google Scholar 

  29. G. Rozenberg and D. Vermeir. On ET0L systems of finite index. Inf. Contr., 38:103–133, 1978.

    Google Scholar 

  30. G. Rozenberg and D. Vermeir. On the effect of the finite index restriction on several families of grammars. Inf. Contr., 39:284–302, 1978.

    Google Scholar 

  31. G. Rozenberg and D. Vermeir. On the effect of the finite index restriction on several families of grammars; Part 2: context dependent systems and grammars. Foundations of Control Engineering, 3(3):126–142, 1978.

    Google Scholar 

  32. G. Rozenberg and D. Vermeir. Extending the notion of finite index. In H. A. Maurer, editor, Colloquium on Automata, Languages and Programming (6), volume 71 of LNCS, pages 479–488. Berlin: Springer, July 1979.

    Google Scholar 

  33. B. Rozoy. The Dyck language D′1 is not generated by any matrix grammar of finite index. Inf. Comp., 74:64–89, 1987.

    Google Scholar 

  34. W. L. Ruzzo, J. Simon, and M. Tompa. Space-bounded hierarchies and probabilistic computations. JCSS, 28:216–230, 1984.

    Google Scholar 

  35. A. K. Salomaa. On the index of a context-free grammar and language. Inf. Contr., 14:474–477, 1969.

    Google Scholar 

  36. A. K. Salomaa. Formal Languages. Academic Press, 1973.

    Google Scholar 

  37. C. E. Shannon. A mathematical theory of communication. The Bell System Technical Journal, 27:379–423, 1948.

    Google Scholar 

  38. E. D. Stotskii. Formal grammars and limitations for derivations. Problemy peredacii informacii (in Russ.), VII(1):87–101, 1971.

    Google Scholar 

  39. E. D. Stotskii. On some strict hierarchies of languages. Naucno-tehniceskaya informaciya, Seriya 2 (in Russ), (4):40–45, 1972.

    Google Scholar 

  40. I. H. Sudborough. A note on tape-bounded complexity classes and linear context-free languages. JACM, 22(4):499–500, October 1975.

    Google Scholar 

  41. I. H. Sudborough. On the tape complexity of deterministic context-free languages. JACM, 25:405–414, 1978.

    Google Scholar 

  42. R. Szelepcsényi. The method of forcing for nondeterministic automata. EATCS Bull., 33:96–100, October 1987.

    Google Scholar 

  43. F. J. Urbanek. A note on conditional grammars. Rev. Roumaine Math. Pures Appl., 28:341–342, 1983.

    Google Scholar 

  44. J. van Leeuwen. The membership problem for ET0L-languages is polynomially complete. IPL, 3(5):138–143, May 1975.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Wilhelm-Schickard-Institut für Informatik, Universität Tübingen, Sand 13, D-72076, Tübingen, Germany

    Henning Fernau & Markus Holzer

Authors
  1. Henning Fernau
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Markus Holzer
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Gheorghe Păun Arto Salomaa

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Fernau, H., Holzer, M. (1997). Conditional context-free languages of finite index. In: Păun, G., Salomaa, A. (eds) New Trends in Formal Languages. Lecture Notes in Computer Science, vol 1218. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-62844-4_2

Download citation

  • DOI: https://doi.org/10.1007/3-540-62844-4_2

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-62844-6

  • Online ISBN: 978-3-540-68703-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation