%0 Conference Proceedings
%T Self-Verifying Finite Automata and Descriptional Complexity
%+ Slovak Academy of Sciences (SAS)
%A Jirásková, Galina
%< avec comité de lecture
%( Lecture Notes in Computer Science
%B 18th International Workshop on Descriptional Complexity of Formal Systems (DCFS)
%C Bucharest, Romania
%Y Cezar Câmpeanu
%Y Florin Manea
%Y Jeffrey Shallit
%I Springer International Publishing
%3 Descriptional Complexity of Formal Systems
%V LNCS-9777
%P 29-44
%8 2016-07-05
%D 2016
%R 10.1007/978-3-319-41114-9_3
%Z Computer Science [cs]Conference papers
%X 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.
%G English
%Z TC 1
%Z WG 1.2
%2 https://inria.hal.science/hal-01633958/document
%2 https://inria.hal.science/hal-01633958/file/416473_1_En_3_Chapter.pdf
%L hal-01633958
%U https://inria.hal.science/hal-01633958
%~ IFIP-LNCS
%~ IFIP
%~ IFIP-TC
%~ IFIP-TC1
%~ IFIP-WG
%~ IFIP-DCFS
%~ IFIP-LNCS-9777
%~ IFIP-WG1-2