In the theory of formal languages of computer science, mathematics, and linguistics, the Dyck language is the language consisting of balanced stringsâ€¦Â (More)

(More)

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)

Is this relevant?

2013

2013

- Barna Saha
- ArXiv
- 2013

Given a string Ïƒ over alphabet Î£ and a grammar G defined over the same alphabet, how many minimum number of repairs: insertionsâ€¦Â (More)

Is this relevant?

2013

2013

- Qirun Zhang, Michael R. Lyu, Hao Yuan, Zhendong Su
- PLDI
- 2013

The context-free language (CFL) reachability problem is a well-known fundamental formulation in program analysis. In practiceâ€¦Â (More)

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)

Is this relevant?

Review

2003

Review

2003

- Jens Liebehenschel
- SIAM J. Comput.
- 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

- J. Ian Munro, Venkatesh Raman
- SIAM J. Comput.
- 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

- J. Ian Munro, Venkatesh Raman
- FOCS
- 1997

We consider the implementation of abstract data types for the static objects: binary tree, rooted ordered tree and balancedâ€¦Â (More)

Is this relevant?

1970

1970

- Maurice Nivat
- STOC
- 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?