Acyclic networks maximizing the printing complexity

DOI10.1016/j.tcs.2004.07.006zbMath1071.68042OpenAlexW2039286009MaRDI QIDQ703493

Franck Guingne, Florent Nicart, André Kempe

Publication date: 11 January 2005

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2004.07.006

zbMATH Keywords

ComplexityAutomataTransducersWorst-case

Mathematics Subject Classification ID

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

Uses Software

• LANGAGE

Cites Work

• The state complexities of some basic operations on regular languages
• Extraction and recoding of input-\(\varepsilon\)-cycles in finite state transducers.
• Characterization of Glushkov automata
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Acyclic networks maximizing the printing complexity