Search
Search Results
-
String and StringBuffer
Chapter 1 briefly referred to the String type in the context of String[] args. This type showed up in subsequent chapters without a proper...
-
A decision procedure for string constraints with string/integer conversion and flat regular constraints
String constraint solving is the core of various testing and verification approaches for scripting languages. Among algorithms for solving string...
-
Permutation-constrained Common String Partitions with Applications
We study a new combinatorial problem based on the famous Minimum Common String Partition problem, which we call Permutation-constrained Common String...
-
Interactive Input
In this chapter, we'll delve into how to add interactive input capabilities to your PowerShell scripts. Interactive input allows your script to...
-
String Constraints with Regex-Counting and String-Length Solved More Efficiently
Regular expressions (regex for short) and string-length function are widely used in string-manipulating programs. Counting is a frequently used...
-
SMTQuery: Analysing SMT-LIB String Benchmarks
Constraint satisfaction problems involving strings have been a subject of theoretical study for decades, but it is only in recent years that...
-
Solving String Constraints Using SAT
String solvers are automated-reasoning tools that can solve combinatorial problems over formal languages. They typically operate on restricted...
-
String Manipulation
In the Bourne shell, very little string manipulation was possible without resorting to external commands. Strings could be concatenated by...
-
Quantum Algorithm for Lexicographically Minimal String Rotation
Lexicographically minimal string rotation (LMSR) is a problem to find the minimal one among all rotations of a string in the lexicographical order,...
-
String Kernel-Based Techniques for Native Language Identification
In recent years, Native Language Identification (NLI) has shown significant interest in computational linguistics. NLI uses an author’s speech or...
-
Maximal \(\alpha \) -Gapped Repeats in a Fibonacci String
A gapped repeat is a substring of the form uvu where u is any nonempty string called arm, and v is any string called gap. A gapped repeat is maximal...
-
Quantum Algorithm for the Multiple String Matching Problem
Let us consider the Multiple String Matching Problem. In this problem, we consider a long string, denoted by t, of length n. This string is referred...
-
Standard Input and Output
The C standard library provides functions allowing us to accept data/characters from the standard input and output data/characters to the standard...
-
String Algorithms
Section 14.1 presents the trie structure which maintains a set of strings. After this, dynamic programming algorithms for determining longest common...
-
Solving the SAT problem with the string multiset rewriting calculus
In this paper, we develop computing machinery within the framework of the String Multiset Rewriting calculus (SMSR), as defined by Barbuti et al. [
4 ],... -
Input to Your Scripts
In the real world of system administration, it's common to encounter scenarios where your scripts need to process and act on various types of input...
-
Essential Input and Output
In this chapter, you’re going to look in more detail at input from the keyboard and output to the screen. The bad news is that there’s quite a lot of...
-
On the Impact of Input Models on the Fault Detection Capabilities of Combinatorial Testing
Testing is an important activity to detect faults before software deployment. We focus on black-box combinatorial testing, where fault detection is...
-
Unity’s New Input System
In this chapter, you explore Unity’s New Input System, a cutting-edge framework that significantly improves game development through superior control...
-
Near-Optimal Quantum Algorithms for String Problems
We study quantum algorithms for several fundamental string problems, including Longest Common Substring , Lexicographically Minimal String Rotation ,...
