Remarks on string-matching and one-way multihead automata

DOI10.1016/0020-0190(87)90157-8MaRDI QIDQ1108049zbMATH OpenOpenAlexFDO

Authors Marek Chrobak, Wojciech Rytter

Publication date 1987

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0020-0190(87)90157-8

zbMATH Keywords

complexitymultihead automataon-line computationstring matching

Mathematics Subject Classification ID

Searching and sorting (68P10) Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45)

Cites work

• A fast string searching algorithm
• Algorithmic Information Theory
• Fast Pattern Matching in Strings
• scientific article; zbMATH DE number 3911754 (Why is no real title available?)
• scientific article; zbMATH DE number 3913680 (Why is no real title available?)
• scientific article; zbMATH DE number 3311755 (Why is no real title available?)
• On-line simulation of k + 1 tapes by k tapes requires nonlinear time
• String-matching cannot be done by a two-head one-way deterministic finite automaton

Cited in

(2)

• Multihead one-way finite automata
• One-way multihead finite automata and 2-bounded languages

This page was built for publication: Remarks on string-matching and one-way multihead automata

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1108049)