Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 233,639,806 papers from all fields of science
Search
Sign In
Create Free Account
String generation
Known as:
Generating strings
In computer science, string generation is the process of creating a set of strings from a collection of rules. This is an opposite process to that of…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
11 relations
Computer science
Deterministic finite automaton
Head-driven phrase structure grammar
Parsing
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
Biometric Bit String Generation from Handwritten Initials on Smart Phones
Ryo Yamagami
,
Y. Yamazaki
International Symposium on Computing and…
2017
Corpus ID: 13788941
As smart-phones have rapidly spread, biometric authentication has recently attracted much attention as a user authentication…
Expand
2016
2016
Biometric Bit String Generation from Handwritten Signatures on Smart Device
Taiki Sowa
,
Suguru Sunada
,
Y. Yamazaki
,
Takeru Miyazaki
International Symposium on Computing and…
2016
Corpus ID: 18323677
Recently, with the rapid spread of smart devices, such as smart-phones and tablet PCs, biometric authentication using handwritten…
Expand
2014
2014
String Metamorphosis with a Probabilistic Way
Nagiri Perindevi
,
C. V. Durga
,
B. Suresh
2014
Corpus ID: 212530999
.
2010
2010
Abstract parsing of string updates and user input
Kyung-Goo Doh
,
Hyunha Kim
,
David A. Schmidt
2010
Corpus ID: 16434179
parsing of string updates and user input Kyung-Goo Doh , Hyunha Kim, and David A. Schmidt ⋆⋆ 1 Hanyang University, Ansan, South…
Expand
2009
2009
RNA, SCFGs and Classifiers
Zsuzsanna Sükösd
,
Paula Tataru
,
J. Hein
2009
Corpus ID: 13333499
We developed, implemented and tested a stochastic context-free grammar (SCFG)-based method to classify RNA molecules into…
Expand
2006
2006
PROBABILISTIC FINITE STATE AUTOMATA AND TIME SERIES ANALYSIS
C. Jalobeanu
2006
Corpus ID: 10139132
Probabilistic finite state automata generating strings of letters is used to represent the symbolic time series. A symbolic time…
Expand
1998
1998
Transfer Constructors
ConstructorsJosef van Genabith
,
A. Frank
,
Michael DornaDublin
1998
Corpus ID: 19002666
We present a modular, lexicalized, reversible and ambiguity preserving approach to semantic based transfer on sets of linear…
Expand
1996
1996
Generating Strings by Replication: A Simple Case
V. Mihalache
,
G. Paun
,
G. Rozenberg
,
A. Salomaa
1996
Corpus ID: 16018118
We consider the following new way of generating a language: start with a string w and a given set of insertion contexts (u,v); if…
Expand
1987
1987
Generating strings with hypergraph grammars
J. Engelfriet
1987
Corpus ID: 125034008
1975
1975
Stochastic Syntax-Directed Translation Schemata for Correction of Errors in Context-Free Languages
M. Thomason
IEEE transactions on computers
1975
Corpus ID: 23333005
A formal method of correcting errors of changed, deleted, and inserted terminals in the strings of a context-free language is…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE