scientific article; zbMATH DE number 3911746

zbMATH Open0571.68071MaRDI QIDQ3687746FDOQ3687746

Authors: Marek Chrobak 

Publication date: 1985

Title of this publication is not available (Why is that?)

Recommendations

• Hierarchies of one-way multihead automata languages
• k\(+1\) heads are better than k for PDAs
• scientific article; zbMATH DE number 3978428
• Head and state hierarchies for unary multi-head finite automata
• One-way multihead finite automata and 2-bounded languages

zbMATH Keywords

language recognitionpush-down automataclass of languages

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cited In (8)

• k\(+1\) heads are better than k for PDAs
• Tight hierarchy of data-independent multi-head automata
• Deterministic two-way one-head pushdown automata are very powerful
• Multiprocessor automata
• One-way multihead finite automata and 2-bounded languages
• Remarks on sorting and one-way multihead finite automata
• Hierarchies of one-way multihead automata languages
• One-variable context-free hedge automata

This page was built for publication:

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