scientific article; zbMATH DE number 1439403

MaRDI QIDQ4949776zbMATH OpenFDO

Authors Etsuro Moriya

Publication date 7 May 2000

zbMATH Keywords

pushdown automaton

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• On The Space Complexity Of Turn Bounded Pushdown Automata
• Descriptional Complexity of Bounded Context-Free Languages
• Descriptional complexity of bounded context-free languages
• Finite turns and the regular closure of linear context-free languages
• scientific article; zbMATH DE number 3858445

Cited in

(9)

• Pushdown automata with reversal-bounded counters
• scientific article; zbMATH DE number 3858445 (Why is no real title available?)
• Descriptional complexity of bounded context-free languages
• Simultaneously One-Turn Two-Pushdown Automata
• scientific article; zbMATH DE number 1786544 (Why is no real title available?)
• On The Space Complexity Of Turn Bounded Pushdown Automata
• scientific article; zbMATH DE number 7439739 (Why is no real title available?)
• Descriptional Complexity of Bounded Context-Free Languages
• Quasi-rocking real-time pushdown 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 Q4949776)