Cargando…
Dynamic Data Structures for Timed Automata Acceptance
We study a variant of the classical membership problem in automata theory, which consists of deciding whether a given input word is accepted by a given automaton. We do so through the lenses of parameterized dynamic data structures: we assume that the automaton is fixed and its size is the parameter...
| Autores principales: | , , , , |
|---|---|
| Formato: | Online Artículo Texto |
| Lenguaje: | English |
| Publicado: |
Springer US
2022
|
| Materias: | |
| Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC9596569/ https://www.ncbi.nlm.nih.gov/pubmed/36313790 http://dx.doi.org/10.1007/s00453-022-01025-8 |