Let be an infinite regular language on a totally ordered alphabet . Feeding a finite deterministic automaton (with output) with the words of , enumerated lexicographically with respect to , leads to an infinite sequence over the output alphabet of the automaton. This process generalizes the concept of -automatic sequence for abstract numeration systems on a regular language (instead of systems in base ). Here, we study the first properties of these sequences and their relations with numeration systems.