AGDES: Automatic Generation of Dependent Event Sequences
Fuente:
arXiv
Saved in:
| Main Author: | |
|---|---|
| Format: | Preprint |
| Published: |
2026
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866911709251239936 |
|---|---|
| author | Guzman, Alexander Obeid |
| author_facet | Guzman, Alexander Obeid |
| contents | This note presents AGDES, a tool for Automatic Generation of Dependent Event Sequences. Each event sequence is either generated as the output word of a deterministic finite automaton (DFA), or produced as the output word of a DFA called transducer that reads events from one or more input sequences, and produces an output sequence. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2605_23808 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | AGDES: Automatic Generation of Dependent Event Sequences Guzman, Alexander Obeid Formal Languages and Automata Theory This note presents AGDES, a tool for Automatic Generation of Dependent Event Sequences. Each event sequence is either generated as the output word of a deterministic finite automaton (DFA), or produced as the output word of a DFA called transducer that reads events from one or more input sequences, and produces an output sequence. |
| title | AGDES: Automatic Generation of Dependent Event Sequences |
| topic | Formal Languages and Automata Theory |
| url | https://arxiv.org/abs/2605.23808 |