Equivalent language models that closely simulate one another and their illustration in terms of L systems

  • Authors:

  • Alexander Meduna;Martin svec;Tomás Kopecek

  • Affiliations:

  • Faculty of Information Technology, Department of Information Systems, Brno University of Technology, Brno, Czech Republic;Faculty of Information Technology, Department of Information Systems, Brno University of Technology, Brno, Czech Republic;Faculty of Information Technology, Department of Information Systems, Brno University of Technology, Brno, Czech Republic

  • Venue:
  • International Journal of Computer Mathematics - Celebrating the Life of David J. Evans
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper, we discuss equivalent formal language models that yield their words in a similar way and conceptualize this similarity. More specifically, if for two models, there is a substitution by which we change each string of every yield sequence in one model so that the sequence of strings resulting from this change represents a yield sequence in the other equivalent model, these two models closely simulate one another; otherwise, they do not. First, we formalize this concept of close simulation in equivalent formal language models in general. Then, we illustrate this concept in terms of EIL systems.