Advanced search
Publication Cover
International Journal of Computer Mathematics Volume 26, 1989 - Issue 3-4
Submit an article Journal homepage
10
Views
2
CrossRef citations to date
0
Altmetric
Original Articles

Hierarchy of k-context-free languages

Part 2

Kai Salomaa Department of Mathematics, University of Turku, Turku, SF-20500, Finland
Pages 193-205 | Received 01 Mar 1988, Published online: 19 Mar 2007

References

  • Dahlhaus , E. and Gaifman , H. 1985 . Concerning two-adjacent context-free languages . Theoret. Comput. Sci. , 41 : 169 – 184 .
  • Dolev , D. and Warmuth , M. K. 1985 . Scheduling flat graphs . SIAM J. Comput. , 14 : 638 – 657 .
  • Dolev , D. and Warmuth , M. K. 1985 . Profile scheduling of opposing forests and level orders . SIAM J. Algebraic Discrete Methods , 6 : 665 – 687 .
  • Ehrenfeucht , A. and Rozenberg , G. 1976 . “ On Θ-determined EOL languages ” . In Automata, Languages, Development , Edited by: Lindenmeyer , A. and Rozenberg , G. 191 – 202 . Amsterdam : North-Holland .
  • Gonczarowski , J. , Kleijn , H. C. M. and Rozenberg , G. 1983 . Closure properties of selective substitution grammars . Internat. J. Comput. Math. , 14 19-42 (Part 1) and 109-135 (Part 2).
  • Gonczarowski , J. and Shamir , E. 1985 . Pattern selector grammars and several parsing algorithms in the context-free style . J. Comput. System Sci. , 30 : 249 – 273 .
  • Gonczarowski , J. and Warmuth , M. K. 1985 . Applications of scheduling theory to formal language theory . Theoret. Comput. Sci. , 37 : 217 – 243 .
  • Gonczarowski , J. and Warmuth , M. K. 1986 . Manipulating derivation forests by scheduling techniques . Theoret. Comput. Sci. , 45 : 87 – 119 .
  • Hopcroft , J. E. and Ullman , J. D. 1979 . “ Introduction to Automata Theory, Languages and Computation ” . Addison-Wesley .
  • Kleijn , H. C M. and Rozenberg , G. 1981 . Context-free like restrictions on selective rewriting . Theoret. Comput. Sci. , 16 : 237 – 269 .
  • Kleijn , H. C. M. and Rozenberg , G. 1983 . On the generative power of regular pattern grammars . Acta Inform. , 20 : 391 – 411 .
  • Rozenberg , G. 1977 . Selective substitution grammars, Part 1 . Elektron. Informationsverarb. Kybernet , 13 : 455 – 463 .
  • Rozenberg , G. and Salomaa , A. 1980 . The Mathematical Theory of L Systems , Academic Press .
  • Rozenberg , G. and Wood , D. 1980 . Context-free grammars with selective rewriting . Acta Inform. , 13 : 257 – 268 .
  • Salomaa , A. 1973 . Formal Languages , Academic Press .
  • Salomaa , K. 1988 . A pumping result for 2-context-free languages . Theoret Comput. Sci. , 62 to appear in

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Order Reprints Request Corporate Permissions

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

Request Academic Permissions

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.

Related research

People also read lists articles that other readers of this article have read.

Recommended articles lists articles that we recommend and is powered by our AI driven recommendation engine.

Cited by lists all citing articles based on Crossref citations.
Articles with the Crossref icon will open in a new tab.