Self-Verifying Finite Automata and Descriptional Complexity - Archive ouverte HAL Access content directly
Conference Papers Year : 2016

Self-Verifying Finite Automata and Descriptional Complexity

(1)
1
Galina Jirásková
  • Function : Author
  • PersonId : 1011781

Abstract

We survey recent results on the descriptional complexity of self-verifying finite automata. In particular, we discuss the cost of simulation of self-verifying finite automata by deterministic finite automata, and the complexity of basic regular operations on languages represented by self-verifying finite automata.
Fichier principal
Vignette du fichier
416473_1_En_3_Chapter.pdf (136.88 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01633958 , version 1 (13-11-2017)

Licence

Attribution - CC BY 4.0

Identifiers

Cite

Galina Jirásková. Self-Verifying Finite Automata and Descriptional Complexity. 18th International Workshop on Descriptional Complexity of Formal Systems (DCFS), Jul 2016, Bucharest, Romania. pp.29-44, ⟨10.1007/978-3-319-41114-9_3⟩. ⟨hal-01633958⟩
38 View
194 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More