Finite automata and rational languages. An introduction

Authors:
J. Berstel
Affiliations:
-
Venue:
Proceedings of the LITP Spring School on Theoretical Computer Science on Formal properties of finite automata and applications
Year:
1989

Citing 0
Cited 4

On congruences of automata defined by directed graphs

Theoretical Computer Science
Acyclic networks maximizing the printing complexity

Theoretical Computer Science - Implementation and application of automata
Running time complexity of printing an acyclic automaton

CIAA'03 Proceedings of the 8th international conference on Implementation and application of automata
Probabilistic Grammars and Languages

Journal of Logic, Language and Information

Quantified Score

Hi-index	0.00

Visualization

Abstract