Advertisement

Acta Informatica

, Volume 35, Issue 3, pp 245–267 | Cite as

Context-free languages over infinite alphabets

  • Edward Y.C. Cheng
  • Michael Kaminski

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.

Keywords

Natural Extension Substantial Evidence Closure Property Pushdown Automaton Infinite Alphabet 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 1998

Authors and Affiliations

  • Edward Y.C. Cheng
    • 1
  • Michael Kaminski
    • 2
  1. 1. Department of Computer and Information Sciences and Engineering, University of Florida, Gainesville, FL 32611-2024, USA (e-mail: yccheng@cise.ufl.edu) US
  2. 2. Department of Computer Science, Technion – Israel Institute of Technology, Haifa 32000, Israel (e-mail: kaminski@as.technion.ac.il) IL

Personalised recommendations