scientific article; zbMATH DE number 897255

zbMath0856.68089MaRDI QIDQ4884649

František Mráz, Martin Plátek

Publication date: 3 February 1997

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

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

erasing automatonlinear bounded Turing machine

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (3)

Characterization of context-pree languages by erasing automata ⋮ A Taxonomy of Deterministic Forgetting Automata ⋮ Unnamed Item

Cites Work

• The method of forced enumeration for nondeterministic automata
• Nondeterministic Space is Closed under Complementation
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: