Succinct representation for (non)deterministic finite automata - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Article Dans Une Revue Journal of Computer and System Sciences Année : 2023

Succinct representation for (non)deterministic finite automata

Résumé

Non)-Deterministic finite automata are one of the simplest models of computation studied in automata theory. Here we study them through the lens of succinct data structures. Towards this goal, we design a data structure for any deterministic automaton D having n states over a σ-letter alphabet using (σ − 1)n log n(1 + o(1)) bits, that determines, given a string x, whether D accepts x in optimal O (|x|) time. We also consider the case when there are N < σ n non-failure transitions, and obtain various time-space trade-offs. Here some of our results are better than the recent work of Cotumaccio and Prezza (SODA 2021). We also exhibit a data structure for non-deterministic automaton N using σ n 2 + n bits that takes O (n 2 |x|) time for string membership checking. Finally, we also provide time and space efficient algorithms for performing several standard operations on the languages accepted by finite automata.
Fichier principal
Vignette du fichier
1-s2.0-S0022000022000526-main.pdf (717.31 Ko) Télécharger le fichier
Origine : Publication financée par une institution

Dates et versions

hal-03913681 , version 1 (28-12-2022)

Identifiants

Citer

Sankardeep Chakraborty, Roberto Grossi, Kunihiko Sadakane, Srinivasa Rao Satti. Succinct representation for (non)deterministic finite automata. Journal of Computer and System Sciences, 2023, 131, pp.1-12. ⟨10.1016/j.jcss.2022.07.002⟩. ⟨hal-03913681⟩
102 Consultations
98 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More