NFA-to-DFA Trade-Off for Regular Operations - Descriptional Complexity of Formal Systems Access content directly
Conference Papers Year : 2019

NFA-to-DFA Trade-Off for Regular Operations

Galina Jirásková
  • Function : Author
  • PersonId : 1011781
Ivana Krajňáková
  • Function : Author
  • PersonId : 1024585

Abstract

We examine the operational state complexity assuming that the operands of a regular operation are represented by nondeterministic finite automata, while the language resulting from the operation is required to be represented by a deterministic finite automaton. We get tight upper bounds $$2^n$$ for complementation, reversal, and star, $$2^m$$ for left and right quotient, $$2^{m+n}$$ for union and symmetric difference, $$2^{m+n}-2^m-2^n+2$$ for intersection, $$2^{m+n}-2^n+1$$ for difference, $$\frac{3}{4}2^{m+n}$$ for concatenation, and $$2^{mn}$$ for shuffle. We use a binary alphabet to describe witnesses for complementation, reversal, star, and left and right quotient, and a quaternary alphabet otherwise. Whenever we use a binary alphabet, it is always optimal.
Fichier principal
Vignette du fichier
480958_1_En_14_Chapter.pdf (349.95 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-02387289 , version 1 (29-11-2019)

Licence

Attribution

Identifiers

Cite

Galina Jirásková, Ivana Krajňáková. NFA-to-DFA Trade-Off for Regular Operations. 21th International Conference on Descriptional Complexity of Formal Systems (DCFS), Jul 2019, Košice, Slovakia. pp.184-196, ⟨10.1007/978-3-030-23247-4_14⟩. ⟨hal-02387289⟩
122 View
78 Download

Altmetric

Share

Gmail Facebook X LinkedIn More