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.

2016

2016

Context-free languages are highly important in computer language processing technology as well as in formal language theory. The… Expand

Is this relevant?

2012

2012

The pumping lemma for context-free languages is a result about pushdown automata which is strikingly similar to the well-known… Expand

Is this relevant?

2012

2012

Seasonal fluctuations of the surface North Equatorial Countercurrent (NECC) across the Pacific basin

[1] Based on multisatellite-derived sea surface current, sea surface height anomaly, and geostrophic current data, the annual… Expand

Is this relevant?

2009

2009

Seki et al. (1991) proved a rather weak pumping lemma for multiple context-free languages, which says that any infinite m… Expand

Is this relevant?

2009

2009

Residuated lattices are important algebras and have close links with various important algebras. Automata theory based on… Expand

Is this relevant?

2008

2008

Apparatus is provided for a wall mounted thermostat to accept and convert manually generated instructions to binary encoded… Expand

Is this relevant?

1993

1993

The Pumping Lemma for context-free languages is a popular tool for proving that languages arenot context-free. It claims that… Expand

Is this relevant?

1989

1989

Abstract In this paper, we introduce a new pumping lemma and a new iteration theorem for deterministic context-free languages… Expand

Is this relevant?

1985

1985

Abstract We establish a pumping lemma for real-time deterministic context-free languages. The pumping lemma is useful to prove… Expand

Is this relevant?

1976

1976

A context-free language is shown to be equivalent to a set of sentences describable by sequences of strings related by finite… Expand

Is this relevant?