Acyclic networks maximizing the printing complexity

Authors:
Franck Guingne;Florent Nicart;André Kempe
Affiliations:
Xerox Research Centre Europe, Grenoble Laboratory, Meylan and Laboratoire d'Informatique Fondamentale et Appliquée de Rouen, Faculté des Sciences et des Techniques, Université de Ro ...;Xerox Research Centre Europe, Grenoble Laboratory, Meylan and Laboratoire d'Informatique Fondamentale et Appliquée de Rouen, Faculté des Sciences et des Techniques, Université de Ro ...;Xerox Research Centre Europe, Grenoble Laboratory, 6 chemin de Maupertuis, 38240 Meylan, France
Venue:
Theoretical Computer Science - Implementation and application of automata
Year:
2004

Citing 8
Cited 0

Finite automata and rational languages. An introduction

Proceedings of the LITP Spring School on Theoretical Computer Science on Formal properties of finite automata and applications
Finite automata

Handbook of theoretical computer science (vol. B)
The state complexities of some basic operations on regular languages

Theoretical Computer Science
Characterization of Glushkov automata

Theoretical Computer Science
Automata, Languages, and Machines

Automata, Languages, and Machines
Introduction to Automata Theory, Languages and Computability

Introduction to Automata Theory, Languages and Computability
Thompson Digraphs: A Characterization

WIA '99 Revised Papers from the 4th International Workshop on Automata Implementation
Extraction and recoding of input-ε-cycles in finite state transducers

Theoretical Computer Science - Implementation and application automata

Quantified Score

Hi-index	0.00

Visualization

Abstract

This article estimates the worst-case running time complexity for traversing and printing all successful paths of a normalized trim acyclic automaton. First, we show that the worst-case structure is a festoon. Then, we prove that the complexity is maximal when we have a distribution of e (Napier constant) outgoing arcs per state on average, and that it can be exponential in the number of arcs.