Running Time Complexity of Printing an Acyclic Automaton

DOI10.1007/3-540-45089-0_13zbMATH Open1279.68155OpenAlexW1919809668MaRDI QIDQ3559778FDOQ3559778

Franck Guingne, André Kempe, Florent Nicart

Publication date: 7 May 2010

Published in: Implementation and Application of Automata (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-45089-0_13

Recommendations

• Minimisation of acyclic deterministic automata in linear time
• scientific article; zbMATH DE number 4092773
• scientific article
• scientific article
• scientific article; zbMATH DE number 7156375
• Complexity of acyclic term graph rewriting
• Complexity of some problems from the theory of automata
• Waiting time and complexity for matching patterns with automata
• Verifying time complexity of Turing machines
• Size complexity of rotating and sweeping automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Analysis of algorithms and problem complexity (68Q25)

Cited In (1)

• Acyclic networks maximizing the printing complexity

This page was built for publication: Running Time Complexity of Printing an Acyclic Automaton

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