Skip to main content
Log in

Context-free languages over infinite alphabets

  • Published:
Acta Informatica Aims and scope Submit manuscript

Abstract.

In this paper we introduce context-free grammars and pushdown automata over infinite alphabets. It is shown that a language is generated by a context-free grammar over an infinite alphabet if and only if it is accepted by a pushdown automaton over an infinite alphabet. Also the generated (accepted) languages possess many of the properties of the ordinary context-free languages: decidability, closure properties, etc.. This provides a substantial evidence for considering context-free grammars and pushdown automata over infinite alphabets as a natural extension of the classical ones.

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

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Author information

Authors and Affiliations

Authors

Additional information

Received November 27, 1995 / March 4, 1997

Rights and permissions

Reprints and permissions

About this article

Cite this article

Cheng, E., Kaminski, M. Context-free languages over infinite alphabets. Acta Informatica 35, 245–267 (1998). https://doi.org/10.1007/s002360050120

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s002360050120

Keywords

Navigation