scientific article; zbMATH DE number 7156375

DOI10.13328/J.CNKI.JOS.005757MaRDI QIDQ5209967zbMATH OpenFDO

Authors Kai Zhu, Guoqing Wu, Lihua Wu, Mengting Yuan

Publication date 22 January 2020

zbMATH Keywords

computational complexityreductiontimed automatareset sequences

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Recommendations

• Complexity of problems concerning reset words for some partial cases of automata
• Complexity of problems concerning reset words for cyclic and Eulerian automata
• Complexity of problems concerning reset words for cyclic and Eulerian automata
• Timed Sets, Functional Complexity, and Computability
• Timed Automata with Integer Resets: Language Inclusion and Expressiveness
• Undecidable Problems About Timed Automata
• scientific article; zbMATH DE number 7297846
• Reset complexity and completely reachable automata with simple idempotents
• Timed Pushdown Automata Revisited
• Timed automata relaxation for reachability

Cited in

(3)

• Timed Sets, Functional Complexity, and Computability
• Synchronizing strategies under partial observability
• Running Time Complexity of Printing an Acyclic Automaton

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 Q5209967)