String operations

Known as: Inverse string homomorphism, Right cancellation, String functions (mathematics) 
In computer science, in the area of formal language theory, frequent use is made of a variety of string functions; however, the notation used is… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2013
Highly Cited
2013
Analyzing web applications requires reasoning about strings and non-strings cohesively. Existing string solvers either ignore non… (More)
  • figure 1
  • figure 3
  • figure 4
  • figure 5
  • figure 6
Is this relevant?
2010
2010
We present a domain-specific imperative language, Bek, that directly models low-level string manipulation code featuring boolean… (More)
  • figure 2
  • figure 3
  • figure 5
  • figure 7
Is this relevant?
2010
2010
Web applications must use special string-manipulating sanitization functions on untrusted user data, but writing these functions… (More)
Is this relevant?
2008
2008
We show that in closed string topology and in open-closed string topology with one D-brane, higher genus stable string operations… (More)
  • figure 2
  • figure 3
Is this relevant?
2008
2008
To open-closed cobordism surfaces, open-closed string topology associates topological quantum field theory (TQFT) operations… (More)
  • figure 3
  • figure 2
  • figure 4
  • figure 5
  • figure 6
Is this relevant?
2006
2006
We first discuss how open/closed chord diagrams, both with and without marked points, act on appropriate Hochschild complexes… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2005
Highly Cited
2005
Injection vulnerabilities pose a major threat to applicationlevel security. Some of the more common types are SQL injection… (More)
  • table 1
  • figure 1
  • figure 2
  • table 2
Is this relevant?
2001
2001
We study relational calculi with support for string operations. While SQL restricts the ability to mix string pattern-matching… (More)
  • figure 1
  • figure 2
Is this relevant?
Highly Cited
1993
Highly Cited
1993
A constraint-satisfaction problem is given by a pair I (the instance) and T (the template) of finite relational structures over… (More)
Is this relevant?
Highly Cited
1989
Highly Cited
1989
One day, you will discover a new adventure and knowledge by spending more money. But when? Do you think that you need to obtain… (More)
Is this relevant?