Skip to Main content Skip to Navigation
Conference papers

Self-Verifying Finite Automata and Descriptional Complexity

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.
Document type :
Conference papers
Complete list of metadata

Cited literature [23 references]  Display  Hide  Download

https://hal.inria.fr/hal-01633958
Contributor : Hal Ifip <>
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

File

416473_1_En_3_Chapter.pdf
Files produced by the author(s)

Licence


Distributed under a Creative Commons Attribution 4.0 International License

Identifiers

Citation

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⟩

Share

Metrics

Record views

105

Files downloads

233