Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Alphabet (formal languages)

Known as: Alphabet (computer science), Alphabet (disambiguation), Input symbol 
In formal language theory, a string is defined as a finite sequence of members of an underlying base set; this set is called the alphabet of a string… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2016
Highly Cited
2016
This paper considers the problem of communication over a discrete memoryless channel (DMC) or an additive white Gaussian noise… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Highly Cited
2004
Highly Cited
2004
We propose the class of visibly pushdown languages as embeddings of context-free languages that is rich enough to model program… Expand
  • figure 1
  • figure 2
  • figure 3
Highly Cited
2000
Highly Cited
2000
We address the issue of compressing and indexing data. We devise a data structure whose space occupancy is a function of the… Expand
  • figure 1
Highly Cited
2000
Highly Cited
2000
This paper describes a probabilistic syntactic approach to the detection and recognition of temporally extended activities and… Expand
Highly Cited
1992
Highly Cited
1992
We investigate a method for inserting rules into discrete-time second-order recurrent neural networks which are trained to… Expand
Highly Cited
1990
Highly Cited
1990
  • S. Verdú
  • IEEE Trans. Inf. Theory
  • 1990
  • Corpus ID: 16990055
Memoryless communication channels with arbitrary alphabets where each input symbol is assigned a cost are considered. The maximum… Expand
  • figure 1
  • figure 2
  • figure 3
Highly Cited
1986
Highly Cited
1986
The main theorem allows an elegant algorithm to be refined into an efficient one. The elegant algorithm for constructing a finite… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Highly Cited
1980
Highly Cited
1980
Abstract In the last few years linguistic approach to picture processing has gained in popularity. A scheme for recognizing… Expand
  • figure 2
  • figure 4
  • figure 5
  • figure 8
  • figure 10
Highly Cited
1965
Highly Cited
1965
Let L(t) = t−1logD(∑piDtni})where pi is the probability of the ith input symbol to a noiseless channel, and ni is the length of… Expand
Highly Cited
1965
Highly Cited
1965
  • F. Hennie
  • Inf. Control.
  • 1965
  • Corpus ID: 18587794
This paper has two purposes. The first is to investigate the characteristics of a restricted class of Turing machines, and to… Expand
  • figure 1