Succinct Representation for (Non)Deterministic Finite Automata

07/22/2019
by   Sankardeep Chakraborty, et al.
0

Deterministic finite automata are one of the simplest and most practical models of computation studied in automata theory. Their conceptual extension is the non-deterministic finite automata which also have plenty of applications. In this article, we study these models through the lens of succinct data structures where our ultimate goal is to encode these mathematical objects using information-theoretically optimal number of bits along with supporting queries on them efficiently. Towards this goal, we first design a succinct data structure for representing any deterministic finite automaton D having n states over a σ-letter alphabet Σ using (σ-1) nlog n + O(n logσ) bits of space, which can determine, given an input string x over Σ, whether D accepts x in O(|x| logσ) time, using constant words of working space. When the input deterministic finite automaton is acyclic, not only we can improve the above space-bound significantly to (σ -1) (n-1)log n+ 3n + O(log^2 σ) + o(n) bits, we also obtain optimal query time for string acceptance checking. More specifically, using our succinct representation, we can check if a given input string x can be accepted by the acyclic deterministic finite automaton using time proportional to the length of x, hence, the optimal query time. We also exhibit a succinct data structure for representing a non-deterministic finite automaton N having n states over a σ-letter alphabet Σ using σ n^2+n bits of space, such that given an input string x, we can decide whether N accepts x efficiently in O(n^2|x|) time. Finally, we also provide time and space-efficient algorithms for performing several standard operations such as union, intersection, and complement on the languages accepted by deterministic finite automata.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/10/2017

A superpolynomial lower bound for the size of non-deterministic complement of an unambiguous automaton

Unambiguous non-deterministic finite automata have intermediate expressi...
research
02/13/2018

Lengths of Words Accepted by Nondeterministic Finite Automata

We consider two natural problems about nondeterministic finite automata....
research
07/27/2021

Version Space Algebras are Acyclic Tree Automata

Version space algebras are ways of representing spaces of programs which...
research
11/08/2021

Graphs can be succinctly indexed for pattern matching in O(|E|^2 + |V|^5 / 2) time

For the first time we provide a succinct pattern matching index for arbi...
research
11/08/2017

Run Compressed Rank/Select for Large Alphabets

Given a string of length n that is composed of r runs of letters from th...
research
10/16/2019

Tree-Shape Grammars for Random Access

Shape grammars are well known in the graphics and design communities but...
research
11/03/2021

Linear-time Minimization of Wheeler DFAs

Wheeler DFAs (WDFAs) are a sub-class of finite-state automata which is p...

Please sign up or login with your details

Forgot password? Click here to reset