Simplifying DPDA using supplementary information

DOI10.1007/978-3-642-21254-3_27MaRDI QIDQ3004593zbMATH OpenOpenAlexFDO

Authors Pavel Labath, Branislav Rovan

Publication date 3 June 2011

Published in Language and Automata Theory and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-21254-3_27

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Recommendations

• Kolmogorov complexity descriptions of the exquisite behaviors of advised deterministic pushdown automata
• Descriptional complexity of pushdown store languages
• Descriptional complexity of pushdown store languages
• scientific article; zbMATH DE number 3862469
• On reducing the number of stack symbols in a PDA

Cited in

(4)

• Usefulness of information and unary languages
• Modeling time criticality of information
• On Usefulness of Information: Framework and NFA Case
• Usefulness of information and decomposability of unary regular languages

This page was built for publication: Simplifying DPDA using supplementary information

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