scientific article; zbMATH DE number 898049

zbMATH Open0853.68118MaRDI QIDQ4884987FDOQ4884987

Authors: Petr Jančar 

Publication date: 21 August 1996

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

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

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

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• Relationships between nondeterministic and deterministic tape complexities
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (4)

• A taxonomy of deterministic forgetting automata
• A Taxonomy of Deterministic Forgetting Automata
• Title not available (Why is that?)
• 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)