Abstract
We introduce the concept of switch transitions for finite state machines. Roughly speaking, a switch transition branches and connects one state (source) with two states (targets), and changes which state it goes to every time it is used. In this way, a switching finite automaton remembers besides the current state also for each switch transition where it points to—this can be seen as an additional bit of memory for each switch transition. We study the accepting capacity of switching automata and show that they are exponentially more succinct than ordinary finite automata. Moreover, the computational complexity of these devices are investigated for standard problems from formal language theory. Here it turns out that some lower bounds can be deduced from problems on regular like expressions with squaring. This is due to the fact that one can construct a linear size switching automaton equivalent to a regular like expression with squaring.
P. Wolf—Supported by the French ANR, project ANR-22-CE48-0001 (TEMPOGRAL).
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Buss, S.R.: The Boolean formula value problem is in ALOGTIME. In: Proceedings of the 19th Annual ACM Symposium on Theory of Computing, pp. 123–131. ACM, New York City (1987). https://doi.org/10.1145/28395.28409
Holzer, M., Kutrib, M.: Automata that may change their mind. In: Freund, R., Hospodár, M., Jirásková, G., Pighizzini, G. (eds.) Proceedings of the 10th International Workshop on Non-Classical Models of Automata and Applications, vol. 332, pp. 83–98 in books\(@\)ocg.at, Österreichische Computer Gesellschaft, Košice, Slovakia (2018)
Hunt, H.B., III.: Observations on the complexity of regular expressions problems. J. Comput. Syst. Sci. 19, 222–236 (1979). https://doi.org/10.1016/0022-0000(79)90002-3
Jiang, T., Ravikumar, B.: A note on the space complexity of some decision problems for finite automata. Inform. Process. Lett. 40, 25–31 (1991). https://doi.org/10.1016/S0020-0190(05)80006-7
Kleene, S.C.: Representation of events in nerve nets and finite automata. In: Shannon, C.E., McCarthy, J. (eds.) Automata Studies, Annals of Mathematics Studies, vol. 34, pp. 2–42. Princeton University Press (1956)
Papadimitriou, C.H.: Computational Complexity. Addison-Wesley (1994)
Petersen, H.: The membership problem for regular expressions with intersection is complete in LOGCFL. In: Alt, H., Ferreira, A. (eds.) Proceedings of the 19th International Symposium on Theoretical Aspects of Computer Science. LNCS, vol. 2285, pp. 513–522. Springer, Antibes - Juan les Pins, France (2002). https://doi.org/10.1007/3-540-45841-7_42
Rabin, M.O., Scott, D.: Finite automata and their decision problems. IBM J. Res. Dev. 3, 114–125 (1959). https://doi.org/10.1147/rd.32.0114
Savitch, W.J.: Relationships between nondeterministic and deterministic tape complexities. J. Comput. Syst. Sci. 4(2), 177–192 (1970). https://doi.org/10.1016/S0022-0000(70)80006-X
Stockmeyer, L.J., Meyer, A.R.: Word problems requiring exponential time. In: Proceedings of the 5th Symposium on Theory of Computing, pp. 1–9 (1973). https://doi.org/10.1145/800125.804029
Thompson, K.: Regular expression search algorithm. Commun. ACM 11(6), 419–422 (1968). https://doi.org/10.1145/363347.363387
Tovey, C.A.: A simplified NP-complete satisfiability problem. Discret. Appl. Math. 8, 85–89 (1984). https://doi.org/10.1016/0166-218X(84)90081-7
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2025 The Author(s), under exclusive license to Springer Nature Switzerland AG
About this paper
Cite this paper
Chapman, J., Holzer, M., Wolf, P. (2025). On Switching Finite State Automata. In: Formenti, E., Durand-Lose, J. (eds) Machines, Computations, and Universality. MCU 2024. Lecture Notes in Computer Science, vol 15270. Springer, Cham. https://doi.org/10.1007/978-3-031-81202-6_3
Download citation
DOI: https://doi.org/10.1007/978-3-031-81202-6_3
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-031-81201-9
Online ISBN: 978-3-031-81202-6
eBook Packages: Computer ScienceComputer Science (R0)