Recognizing a symmetry predicate by multihead Turing machines with input

From MaRDI portal

Revision as of 07:18, 31 January 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:1225610

Jump to:navigation, search

zbMath0326.02027MaRDI QIDQ1225610

A. O. Slisenko

Publication date: 1976

Published in: Proceedings of the Steklov Institute of Mathematics (Search for Journal in Brave)

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45) Turing machines and related notions (03D10)

Related Items (3)

Efficient string matching on packed texts ⋮ Parallel detection of all palindromes in a string ⋮ The derivation of on-line algorithms, with an application to finding palindromes

This page was built for publication: Recognizing a symmetry predicate by multihead Turing machines with input

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1225610&oldid=13302321"