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

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

Related topics

Related topics

11 relations
Computer scienceDeterministic finite automatonHead-driven phrase structure grammarParsing
Expand

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2012
2012
The Soundness of Internalized Polarity Marking
This paper provides a foundation for the polarity marking technique introduced by David Dowty [3] in connection with monotonicity… Expand
  • figure 2
Is this relevant?
2010
2010
Parsing Unary Boolean Grammars Using Online Convolution
Consider context-free grammars generating strings over a one-letter alphabet. For the membership problem for such grammars… Expand
  • figure 1
Is this relevant?
2010
2010
A model of computation and representation in the brain
The brain is first and foremost a control system that is capable of building an internal representation of the external world… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2007
2007
Multi-Bits Biometric String Generation based on the Likelihood Ratio
Preserving the privacy of biometric information stored in biometric systems is becoming a key issue. An important element in… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2006
2006
Extended Spiking Neural P Systems Generating Strings and Vectors of Non-Negative Integers Artiom Alhazov
We consider extended variants of spiking neural P systems and show how these extensions of the original model allow for easy… Expand
Is this relevant?
2000
2000
Relationship between strong and weak generative power of formal systems
The relationship between strong and weak generative powers of formal systems is explored, in particular, from the point of view… Expand
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
1995
1995
Generating strings for bipartite Steinhaus graphs
Abstract Let b ( n ) be the number of bipartite Steinhaus graphs with n vertices. We show that b ( n ) satisfies the recurrence… Expand
  • figure 1
  • figure 2
  • figure 4
Is this relevant?
1987
1987
Generating strings with hypergraph grammars
 
Is this relevant?
1973
1973
On reference string generation processes
Efficient memory management is important for optimizing computer usage. Intuition, simulation, experience, and analysis have… Expand
  • figure 4.1
  • figure 4.2
Is this relevant?
1970
1970
Nonlinear Regression With Linear Constraints: An Extension of the Magnified Diagonal Method
A syntax-directed picture analysis system based on a formal picture description scheme is described. The system accepts a… Expand
Is this relevant?
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy, Terms of Service, and Dataset License
ACCEPT & CONTINUE