String-matching cannot be done by a two-head one-way deterministic finite automation
Reads0
Chats0
TLDR
This paper answers the special case k = 2 of the open question, due to Galil and Seiferas (1983), whether a k-head one-way deterministic finite automaton can perform string-matching.About:
This article is published in Information Processing Letters.The article was published on 1986-04-02 and is currently open access. It has received 22 citations till now. The article focuses on the topics: Deterministic automaton & Two-way deterministic finite automaton.read more
Citations
More filters
Book ChapterDOI
Algorithms for finding patterns in strings
TL;DR: This chapter discusses the algorithms for solving string-matching problems that have proven useful for text-editing and text-processing applications and several innovative, theoretically interesting algorithms have been devised that run significantly faster than the obvious brute-force method.
Book ChapterDOI
Kolmogorov complexity and its applications
Ming Li,Paul M. B. Vitányi +1 more
TL;DR: Kolmogorov complexity has its roots in probability theory, combinatorics, and philosophical notions of randomness, and came to fruition using the recent development of the theory of algorithms.
Proceedings ArticleDOI
Two decades of applied Kolmogorov complexity: in memoriam Andrei Nikolaevich Kolmogorov 1903-87
Ming Li,Paul M. B. Vitányi +1 more
TL;DR: Kolmogorov complexity as discussed by the authors is based on a theory of information content of strings, intuitively, that the amount of information in a finite string is the size (i.e. number of bits) of the smallest program that, started with a blank memory, computes the string and then terminates.
Journal ArticleDOI
Algorithms for string searching
TL;DR: This work surveys several algorithms for searching a string in a piece of text and includes theoretical and empirical results, as well as the actual code of each algorithm.
References
More filters
Book
Introduction to Automata Theory, Languages, and Computation
TL;DR: This book is a rigorous exposition of formal languages and models of computation, with an introduction to computational complexity, appropriate for upper-level computer science undergraduates who are comfortable with mathematical arguments.
Proceedings Article
Time-Space-Optimal String Matching
TL;DR: An algorithm is designed and analyzed which realizes both asymptotic bounds simultaneously and makes possible a completely general implementation as a Fortran subroutine or even as a six-head finite automaton.
Journal ArticleDOI
Time-space-optimal string matching
TL;DR: In this article, the authors design and analyze an algorithm which realizes both asymptotic bounds simultaneously and makes possible a completely general implementation as a Fortran subroutine or even as a six-head finite automaton.
Journal ArticleDOI
k + 1 Heads Are Better than k
TL;DR: There are languages which can be recognized by a deterministic (k + 1)-headed oneway finite automaton but which cannot be recognizing by a k-headed one-way (deterministic or non-Deterministic) finite Automaton.
Journal ArticleDOI
Fooling a two way automation or one pushdown store is better than one counter for two way machines
Pavol Duris,Zvi Galil +1 more
TL;DR: Since L is accepted by a two-way deterministic pushdown automation, it is shown that one pushdown stack is more powerful than one counter for deterministic two way machines.