Skip to search formSkip to main content

You are currently offline. Some features of the site may not work correctly.

Semantic Scholar uses AI to extract papers important to this topic.

Highly Cited

2017

Highly Cited

2017

Abstract Developing stable and efficient bifunctional catalysts for overall water splitting into hydrogen and oxygen is a… Expand

Is this relevant?

2011

2011

Heap-based data structures play an important role in modern programming concepts. However standard verification algorithms cannot… Expand

Is this relevant?

2002

2002

We give inequational and equational axioms for semirings with a fixed-point operator and formally develop a fragment of the… Expand

Is this relevant?

2000

2000

We show that bisimulation equivalence is decidable for pushdown automata without epsilon-transitions.

Is this relevant?

1999

1999

Abstract We develop a new method for placing a given context-free grammar into Greibach normal form with only polynomial increase… Expand

Is this relevant?

1997

1997

We develop a direct method for placing a given context-free grammar into Greibach normal form with only polynomial increase of… Expand

Is this relevant?

Highly Cited

1995

Highly Cited

1995

Tree insertion grammar (TIG) is a tree-based formalism that makes use of tree substitution and tree adjunction. TIG is related to… Expand

Is this relevant?

1986

1986

Abstract We present an algorithm which, given an arbitrary e-free and chain-free context-free grammar, produces an equivalent… Expand

Is this relevant?

1976

1976

It is shown that every strict deterministic language may be given a strict deterministic grammar which is also in Greibach normal… Expand

Is this relevant?

1975

1975

The connections are established between full and bounded grammatical complexity measures of context-free languages for the case… Expand

Is this relevant?