Self-Verifying Finite Automata and Descriptional Complexity - Descriptional Complexity of Formal Systems (DCFS 2016)
Conference Papers Year : 2016

Self-Verifying Finite Automata and Descriptional Complexity

Galina Jirásková
  • Function : Author
  • PersonId : 1011781
Slovak Academy of Sciences

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.

Domains

Computer Science [cs]
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)

Hal Ifip  : Connect in order to contact the contributor

https://inria.hal.science/hal-01633958

Submitted on : Monday, November 13, 2017-3:33:00 PM

Last modification on : Monday, November 13, 2017-3:35:32 PM

Long-term archiving on : Wednesday, February 14, 2018-3:10:28 PM

Download

Dates and versions

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

Licence

Attribution

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⟩

Export

BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite

Collections

IFIP-LNCS IFIP IFIP-TC IFIP-TC1 IFIP-WG IFIP-DCFS IFIP-LNCS-9777 IFIP-WG1-2
73 View
243 Download

Altmetric

Share

More