Results 271 to 280 of about 859,079 (303)

On slender context-free languages

1995
In this paper we study slender context-free languages, i.e., those containing at most a constant number of words of each length. Recently, Ilie proved that every such language can be described by a finite union of terms of the form uv i wx i y [I]. We provide a completely different proof of this, using constructive methods.
openaire   +1 more source

Context-Free Languages

1990
Berstel, Jean, Boasson, L.
openaire   +2 more sources

Uniform Random Generation of Strings in a Context-Free Language

SIAM journal on computing (Print), 1983
T. Hickey, Jacques Cohen
semanticscholar   +1 more source

Finding the Growth Rate of a Regular or Context-Free Language in Polynomial Time

International Journal of Foundations of Computer Science, 2010
Paweł Gawrychowski, D. Krieger, N. Rampersad, J. Shallit   +3 more
semanticscholar   +1 more source

Parallel RAMs with Owned Global Memory and Deterministic Context-Free Language Recognition (Extended Abstract)

International Colloquium on Automata, Languages and Programming, 1986
Patrick W. Dymond, W. Ruzzo
semanticscholar   +1 more source

English is Not a Context-Free Language

, 1984
J. Higginbotham
semanticscholar   +1 more source

Generating Words in a Context-Free Language Uniformly at Random

Information Processing Letters, 1994
Harry G. Mairson
semanticscholar   +1 more source

Context-Free Language Processing in Time n^3

Scandinavian Workshop on Algorithm Theory, 1966
D. Younger
semanticscholar   +1 more source

On the Complexity of General Context-Free Language Parsing and Recognition (Extended Abstract)

International Colloquium on Automata, Languages and Programming, 1979
W. Ruzzo
semanticscholar   +1 more source

Bias-Free Language: LGBTQ + Clients and the New APA Manual

Journal of LGBTQ Issues in Counseling, 2021
Nicole Noble, Loretta Bradley
exaly