Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 217,797,481 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.
2019
2019
Fault‐based test generation for regular expressions by mutation
Paolo Arcaini
,
A. Gargantini
,
E. Riccobene
Software testing, verification & reliability
2019
Corpus ID: 52267490
Regular expressions are used to characterize sets of strings (ie, languages) using a pattern‐based syntax. They are applied in…
Expand
2018
2018
ReScue: Crafting Regular Expression DoS Attacks*
Yuju Shen
,
Yanyan Jiang
,
Chang Xu
,
Ping Yu
,
Xiaoxing Ma
,
Jian Lu
International Conference on Automated Software…
2018
Corpus ID: 51805668
Regular expression (regex) with modern extensions is one of the most popular string processing tools. However, poorly-designed…
Expand
2016
2016
Recognizing handwritten single digits and digit strings using deep architecture of neural networks
Raid Saabni
International Conference on Artificial…
2016
Corpus ID: 18137097
Automatic handwriting recognition of digits and digit strings, are of real interest commercially and as an academic research…
Expand
2015
2015
Graph parsing with s-graph grammars
Jonas Groschwitz
,
Alexander Koller
,
Christoph Teichmann
Annual Meeting of the Association for…
2015
Corpus ID: 14333463
A key problem in semantic parsing with graph-based semantic representations is graph parsing, i.e. computing all possible…
Expand
2010
2010
Parsing Unary Boolean Grammars Using Online Convolution
A. Okhotin
,
Christian Reitwießner
Advances and Applications of Automata on Words…
2010
Corpus ID: 592599
Consider context-free grammars generating strings over a one-letter alphabet. For the membership problem for such grammars…
Expand
Highly Cited
2008
Highly Cited
2008
Spiking neural P systems with extended rules: universality and languages
H. Chen
,
M. Ionescu
,
Tseren-Onolt Ishdorj
,
A. Paun
,
G. Paun
,
M. Pérez-Jiménez
Natural Computing
2008
Corpus ID: 5736957
We consider spiking neural P systems with rules allowed to introduce zero, one, or more spikes at the same time. The motivation…
Expand
1987
1987
Generating strings with hypergraph grammars
J. Engelfriet
1987
Corpus ID: 125034008
Highly Cited
1970
Highly Cited
1970
Nonlinear Regression With Linear Constraints: An Extension of the Magnified Diagonal Method
R. Shrager
JACM
1970
Corpus ID: 19170775
A syntax-directed picture analysis system based on a formal picture description scheme is described. The system accepts a…
Expand
Highly Cited
1970
Highly Cited
1970
Parsing of Graph-Representable Pictures
A. Shaw
JACM
1970
Corpus ID: 16340044
A syntax-directed picture analysis system based on a formal picture description scheme is described. The system accepts a…
Expand
Highly Cited
1969
Highly Cited
1969
A Formal Picture Description Scheme as a Basis for Picture Processing Systems
A. Shaw
Information and Control
1969
Corpus ID: 16463461
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