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… (More)
Wikipedia

Related topics

Related topics

18 relations
AlgorithmAutomata theoryBoyer–Moore–Horspool algorithmDeterministic finite automaton
(More)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2016
Highly Cited
2016
Fundamental Limits of Communication With Low Probability of Detection
This paper considers the problem of communication over a discrete memoryless channel (DMC) or an additive white Gaussian noise… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
2007
Highly Cited
2007
Secure Arithmetic Coding
Although arithmetic coding offers extremely high coding efficiency, it provides little or no security as traditionally… (More)
  • figure 1
  • figure 2
  • figure 4
  • table I
  • table II
Is this relevant?
2007
2007
Random Sparse Linear Systems Observed Via Arbitrary Channels: A Decoupling Principle
This paper studies the problem of estimating the vector input to a sparse linear transformation based on the observation of the… (More)
  • figure 1
  • figure 3
  • figure 2
Is this relevant?
2007
2007
Metric-Based Symbol Predistortion Techniques for Peak Power Reduction in OFDM Systems
In this paper, we present a novel metric-based symbol predistortion algorithm and describe three variants for peak-to-average… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2005
Highly Cited
2005
Design of integrated multimedia compression and encryption systems
Two approaches for integrating encryption with multimedia compression systems are studied in this research, i.e., selective… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2004
Highly Cited
2004
Visibly pushdown languages
We propose the class of visibly pushdown languages as embeddings of context-free languages that is rich enough to model program… (More)
Is this relevant?
2004
2004
Blind and semi-blind FIR multichannel estimation: (global) identifiability conditions
Two channel estimation methods are often opposed: training sequence methods that use the information induced by known symbols and… (More)
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
2000
2000
A Low-Power CAM Design for LZ Data Compression
ÐLow-power and high-performance data compressors play an increasingly important role in the portable mobile computing and… (More)
  • figure 1
  • figure 3
  • figure 2
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2000
Highly Cited
2000
Recognition of Visual Activities and Interactions by Stochastic Parsing
ÐThis paper describes a probabilistic syntactic approach to the detection and recognition of temporally extended activities and… (More)
Is this relevant?
1980
1980
Recognition of handprinted Tamil characters
In the last few years linguistic approach to picture processing has gained in popularity. A scheme for recognizing handprinted… (More)
  • figure 2
  • figure 4
  • figure 5
  • figure 8
  • figure 10
Is this relevant?