A connection between concurrency and language theory

Research output: Contribution to journalArticle

2 Citations (Scopus)

Abstract

We show that three fixed point structures equipped with (sequential) composition, a sum operation, and a fixed point operation share the same valid equations. These are the theories of (context-free) languages, (regular) tree languages, and simulation equivalence classes of (regular) synchronization trees (or processes). The results reveal a close relationship between classical language theory and process algebra.

Original languageEnglish
Pages (from-to)143-164
Number of pages22
JournalElectronic Notes in Theoretical Computer Science
Volume298
DOIs
Publication statusPublished - Nov 4 2013

Fingerprint

Context free languages
Equivalence classes
Concurrency
Algebra
Synchronization
Fixed point
Context-free Languages
Process Algebra
Equivalence class
Chemical analysis
Valid
Simulation
Language
Relationships

Keywords

  • context-free languages
  • Fixed point operations
  • iteration theories
  • regular tree languages
  • simulation equivalence
  • synchronization trees

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

A connection between concurrency and language theory. / Ésik, Z.

In: Electronic Notes in Theoretical Computer Science, Vol. 298, 04.11.2013, p. 143-164.

Research output: Contribution to journalArticle

@article{b3c9a34847b0459da04b920bbe4990b2,
title = "A connection between concurrency and language theory",
abstract = "We show that three fixed point structures equipped with (sequential) composition, a sum operation, and a fixed point operation share the same valid equations. These are the theories of (context-free) languages, (regular) tree languages, and simulation equivalence classes of (regular) synchronization trees (or processes). The results reveal a close relationship between classical language theory and process algebra.",
keywords = "context-free languages, Fixed point operations, iteration theories, regular tree languages, simulation equivalence, synchronization trees",
author = "Z. {\'E}sik",
year = "2013",
month = "11",
day = "4",
doi = "10.1016/j.entcs.2013.09.011",
language = "English",
volume = "298",
pages = "143--164",
journal = "Electronic Notes in Theoretical Computer Science",
issn = "1571-0661",
publisher = "Elsevier",

}

TY - JOUR

T1 - A connection between concurrency and language theory

AU - Ésik, Z.

PY - 2013/11/4

Y1 - 2013/11/4

N2 - We show that three fixed point structures equipped with (sequential) composition, a sum operation, and a fixed point operation share the same valid equations. These are the theories of (context-free) languages, (regular) tree languages, and simulation equivalence classes of (regular) synchronization trees (or processes). The results reveal a close relationship between classical language theory and process algebra.

AB - We show that three fixed point structures equipped with (sequential) composition, a sum operation, and a fixed point operation share the same valid equations. These are the theories of (context-free) languages, (regular) tree languages, and simulation equivalence classes of (regular) synchronization trees (or processes). The results reveal a close relationship between classical language theory and process algebra.

KW - context-free languages

KW - Fixed point operations

KW - iteration theories

KW - regular tree languages

KW - simulation equivalence

KW - synchronization trees

UR - http://www.scopus.com/inward/record.url?scp=84888074504&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84888074504&partnerID=8YFLogxK

U2 - 10.1016/j.entcs.2013.09.011

DO - 10.1016/j.entcs.2013.09.011

M3 - Article

AN - SCOPUS:84888074504

VL - 298

SP - 143

EP - 164

JO - Electronic Notes in Theoretical Computer Science

JF - Electronic Notes in Theoretical Computer Science

SN - 1571-0661

ER -