On Computational Power of Partially Blind Automata

DOI10.2478/V10294-012-0003-5zbMath1277.68074OpenAlexW2086501091MaRDI QIDQ2867275

Pavol Ďuriš

Publication date: 11 December 2013

Published in: Journal of Applied Mathematics, Statistics and Informatics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2478/v10294-012-0003-5

zbMATH Keywords

multihead finite automataone-way finite automatablind head

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• Unnamed Item
• Knapsack problems for NL
• Reversal-bounded multipushdown machines
• Remarks on the complexity of nondeterministic counter languages
• On partially blind multihead finite automata.
• A Note on Tape-Bounded Complexity Classes and Linear Context-Free languages
• Reversal-Bounded Multicounter Machines and Their Decision Problems
• k + 1 Heads Are Better than k
• Multi-tape and multi-head pushdown automata

This page was built for publication: On Computational Power of Partially Blind Automata