Succinct representation for (non)deterministic finite automata
Work
Year: 2022
Type: article
Abstract: (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 des... more
Institutions The University of Tokyo, University of Pisa, Université Claude Bernard Lyon 1, Norwegian University of Science and Technology
Cites: 20
Cited by: 4
Related to: 10
FWCI: 0.723
Citation percentile (by year/subfield): 58.55
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: hybrid
APC paid (est): $2,520