Succinct representations for (non)deterministic finite automata
From MaRDI portal
Publication:2232264
DOI10.1007/978-3-030-68195-1_5OpenAlexW3133800261MaRDI QIDQ2232264
Kunihiko Sadakane, Sankardeep Chakraborty, Srinivasa Rao Satti, Roberto Grossi
Publication date: 4 October 2021
Full work available at URL: https://arxiv.org/abs/1907.09271
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Succinct encoding of arbitrary graphs
- Enumeration and random generation of accessible automata
- An efficient representation of partitions of integers
- Wheeler graphs: a framework for BWT-based data structures
- Succinct representations for (non)deterministic finite automata
- Succinct data structures for families of interval graphs
- Enumeration and generation with a string automata representation
- Exact enumeration of acyclic deterministic automata
- Succinct Representation of Balanced Parentheses and Static Trees
- Fully Functional Static and Dynamic Succinct Trees
- Changing base without losing space
- Succinct indexable dictionaries with applications to encoding k -ary trees, prefix sums and multisets
This page was built for publication: Succinct representations for (non)deterministic finite automata
