scientific article; zbMATH DE number 898049

MaRDI QIDQ4884987zbMATH OpenFDO

Authors Petr Jančar

Publication date 21 August 1996

Full work available at URL https://eudml.org/doc/23754

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• Deterministic forgetting planar automata are more powerful than nondeterministic finite-state planar automata
• A taxonomy of deterministic forgetting automata
• A Taxonomy of Deterministic Forgetting Automata
• Forgetting automata and contex-free languages
• scientific article; zbMATH DE number 3976379
• scientific article; zbMATH DE number 1333609
• FORGETTING AUTOMATA AND UNARY LANGUAGES
• Forgetting Automata and Unary Languages
• A hierarchy of monotone deterministic non-forgetting restarting automata
• On finite automata with limited nondeterminism

Cites work

• scientific article; zbMATH DE number 3628417 (Why is no real title available?)
• scientific article; zbMATH DE number 1333609 (Why is no real title available?)
• scientific article; zbMATH DE number 3311755 (Why is no real title available?)
• Relationships between nondeterministic and deterministic tape complexities

Cited in

(4)

• A taxonomy of deterministic forgetting automata
• A Taxonomy of Deterministic Forgetting Automata
• scientific article; zbMATH DE number 897255 (Why is no real title available?)
• Deterministic forgetting planar automata are more powerful than nondeterministic finite-state planar 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 Q4884987)