Product
Help
Pricing
About
Jobs
Log in
Get started
Keyword
Add to collection
binary alphabet
Description:
A set of two symbols used to form strings in formal-language theory, coding, and computation.
Primary topic:
semigroups and automata theory (44%)
Related topics:
semigroups and automata theory (44%),
Algorithms and Data Compression (25%)
Wikidata ID:
wiki/Q837518
OpenAlex ID:
keywords/binary-alphabet
The Complexity of Some Problems on Subsequences and Supersequences
1978
·
David Maier
·
Journal of the ACM
·
694
PDF
Department of Computer Science
1991
·
Marco De Gemmis
, Ernesto William
, et al.
·
Journal of Computational and Applied Mathematics
·
623
Source polarization
2010
·
Erdal Arikan
·
IEEE International Symposium on Information Theory (ISIT)
·
331
PDF
The coding of messages subject to chance errors
1957
·
J. Wolfowitz
·
Illinois Journal of Mathematics
·
178
PDF
An algorithm for source coding
1972
·
J. Schalkwijk
·
IEEE Transactions on Information Theory
·
174
The shortest common supersequence problem over binary alphabet is NP-complete
1981
·
Kari-Jouko Räihä
, Esko Ukkonen
·
Theoretical Computer Science
·
157
State complexity of some operations on binary regular languages
2004
·
Galina Jirásková
·
Theoretical Computer Science
·
138
PDF
The complexity of multiple sequence alignment with SP-score that is a metric
2001
·
Paola Bonizzoni
, Gianluca Della Vedova
·
Theoretical Computer Science
·
124
PDF
Synthesis of Digital Automata
1965
·
В. М. Глушков
·
111
Finite Automata, Digraph Connectivity, and Regular Expression Size
2008
·
Hermann Gruber
, Markus Holzer
·
Lecture notes in computer science
·
102
Multivariate Fine-Grained Complexity of Longest Common Subsequence
2018
·
Karl Bringman
, Marvin Künnemann
·
Society for Industrial and Applied Mathematics eBooks
·
99
PDF
Towards coding for maximum errors in interactive communication
2011
·
Mark Braverman
, Anup Rao
·
ACM Symposium on Theory of Computing (STOC)
·
93
PDF
The Unsolvability of the Equivalence Problem for $\varepsilon $-Free NGSM’s with Unary Input (Output) Alphabet and Applications
1978
·
Oscar H. Ibarra
·
SIAM Journal on Computing
·
91
Theoretical and empirical comparisons of approximate string matching algorithms
1992
·
William I. Chang
, Jordan Lampe
·
Lecture notes in computer science
·
84
Optimal Error Correction Against Computationally Bounded Noise
2005
·
Silvio Micali
, Chris Peikert
, et al.
·
Lecture notes in computer science
·
82
PDF
Conditional entropy of ordinal patterns
2013
·
Anton M. Unakafov
, Karsten Keller
·
Physica D Nonlinear Phenomena
·
78
PDF
On deterministic finite automata and syntactic monoid size
2004
·
Markus Holzer
, Barbara König
·
Theoretical Computer Science
·
75
PDF
Improved bounds on the average length of longest common subsequences
2009
·
George S. Lueker
·
Journal of the ACM
·
65
State complexity of cyclic shift
2007
·
Galina Jirásková
, Alexander Okhotin
·
RAIRO - Theoretical Informatics and Applications
·
65
PDF
Justification of Logarithmic Loss via the Benefit of Side Information
2015
·
Jiantao Jiao
, Thomas A. Courtade
, et al.
·
IEEE Transactions on Information Theory
·
64
PDF
On Approximate Jumbled Pattern Matching in Strings
2011
·
Péter Burcsi
, Ferdinando Cicalese
, et al.
·
Theory of Computing Systems
·
60
On-line string matching algorithms: survey and experimental results
2001
·
P.D. Michailidis
, K.G. Margaritis
·
International Journal of Computer Mathematics
·
59
More on the complexity of common superstring and supersequence problems
1994
·
Martin Middendorf
·
Theoretical Computer Science
·
59
PDF
Probability estimation in arithmetic and adaptive-Huffman entropy coders
1995
·
D.L. Duttweiler
, C. Chamzas
·
IEEE Transactions on Image Processing
·
58
Hardness results for the center and median string problems under the weighted and unweighted edit distances
2004
·
François Nicolas
, Eric Rivals
·
Journal of Discrete Algorithms
·
57
PDF
Show more works
View as search
Works count:
655
Citation count:
8,351
Year
Topic
Type