%0 Conference Proceedings
%T Finite Automata with Undirected State Graphs
%+ Justus-Liebig-Universität Gießen = Justus Liebig University (JLU)
%A Kutrib, Martin
%A Malcher, Andreas
%A Schneider, Christian
%< avec comité de lecture
%( Lecture Notes in Computer Science
%B 20th International Conference on Descriptional Complexity of Formal Systems (DCFS)
%C Halifax, NS, Canada
%Y Stavros Konstantinidis
%Y Giovanni Pighizzini
%I Springer International Publishing
%3 Descriptional Complexity of Formal Systems
%V LNCS-10952
%P 212-223
%8 2018-07-25
%D 2018
%R 10.1007/978-3-319-94631-3_18
%Z Computer Science [cs]Conference papers
%X We investigate finite automata whose state graphs are undirected. This means that for any transition from state p to q consuming some letter a from the input there exists a symmetric transition from state q to p consuming a letter a as well. So, the corresponding language families are subregular and, in particular in the deterministic case, subreversible. In detail, we study the operational descriptional complexity of deterministic and nondeterministic undirected finite automata. To this end, the different types of automata on alphabets with few letters are characterized. Then the operational state complexity of the Boolean operations as well as the operations concatenation and iteration is investigated, where tight upper and lower bounds are derived for unary as well as arbitrary alphabets under the condition that the corresponding language classes are closed under the operation considered.
%G English
%Z TC 1
%Z WG 1.2
%2 https://inria.hal.science/hal-01905634/document
%2 https://inria.hal.science/hal-01905634/file/470153_1_En_18_Chapter.pdf
%L hal-01905634
%U https://inria.hal.science/hal-01905634
%~ IFIP-LNCS
%~ IFIP
%~ IFIP-TC
%~ IFIP-TC1
%~ IFIP-WG
%~ IFIP-DCFS
%~ IFIP-WG1-2
%~ IFIP-LNCS-10952