Dyck language

Known as: Balanced parentheses, Dyck word 
In the theory of formal languages of computer science, mathematics, and linguistics, the Dyck language is the language consisting of balanced strings… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1969-2018
024619692018

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
  • Barna Saha
  • 2014 IEEE 55th Annual Symposium on Foundations of…
  • 2014
Given a string σ over alphabet Σ and a grammar G defined over the same alphabet, how many minimum number of repairs… (More)
  • figure 1
Is this relevant?
2013
2013
Given a string σ over alphabet Σ and a grammar G defined over the same alphabet, how many minimum number of repairs: insertions… (More)
  • figure 1
Is this relevant?
2013
2013
The context-free language (CFL) reachability problem is a well-known fundamental formulation in program analysis. In practice… (More)
  • table 1
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
2007
2007
Given two disjoint alphabets T and T ] and a relation R T T ] , the generalized Dyck language D R over T T ] consists of all… (More)
Is this relevant?
2007
2007
Insertion-deletion operations are much investigated in linguistics and in DNA computing and several characterizations of Turing… (More)
Is this relevant?
Highly Cited
2004
Highly Cited
2004
We consider succinct, or highly space-efficient, representations of a (static) string consisting of n pairs of balanced… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Review
2003
Review
2003
Given two disjoint alphabets T and T ] and a relation R T T ] , the generalized Dyck language D R over T T ] consists of all… (More)
Is this relevant?
Highly Cited
2001
Highly Cited
2001
We consider the implementation of abstract data types for the static objects: binary tree, rooted ordered tree, and a balanced… (More)
Is this relevant?
Highly Cited
1997
Highly Cited
1997
We consider the implementation of abstract data types for the static objects: binary tree, rooted ordered tree and balanced… (More)
  • figure 1.2
  • figure 1
Is this relevant?
1970
1970
We recall that the Dyck language on the alphabet of 2n letters X &equil; {x<subscrpt>1</subscrpt>,...,x<subscrpt>n</subscrpt… (More)
Is this relevant?