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

Mathematics Subject Classification ID

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

Recommendations

• Complexity of some problems from the theory of automata 👍 👎
• Waiting time and complexity for matching patterns with automata 👍 👎
• Size complexity of rotating and sweeping automata 👍 👎
• Minimisation of acyclic deterministic automata in linear time 👍 👎
• Verifying time complexity of Turing machines 👍 👎
• Complexity of Acyclic Term Graph Rewriting. 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎

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)