Author:
Pighizzini Giovanni,Prigioniero Luca,Sádovský Šimon
Abstract
AbstractThe descriptional complexity of basic operations on regular languages using 1-limited automata, a restricted version of one-tape Turing machines, is investigated. When simulating operations on deterministic finite automata with deterministic 1-limited automata, the sizes of the resulting devices are polynomial in the sizes of the simulated machines. The situation is different when the operations are applied to deterministic 1-limited automata: while for boolean operations the simulations remain polynomial, for product, star, and reversal they cost exponential in size. The costs for product and star do not reduce if the given machines are sweeping two-way deterministic finite automata. These bounds are tight.
Funder
Slovak Scientific Grant Agency VEGA
Publisher
Springer Science and Business Media LLC
Reference20 articles.
1. Pighizzini, G., Prigioniero, L., Sádovský, S.: Performing regular operations with 1-limited automata. In: DLT 2022, Proceedings. Lecture Notes in Computer Science, vol. 13257, pp. 239–250. Springer, Cham (2022). https://doi.org/10.1007/978-3-031-05578-2_19
2. Maslov, A.N.: Estimates of the number of states of finite automata. In: Doklady Akademii Nauk, vol. 194, pp. 1266–1268 (1970). Russian Academy of Sciences
3. Leiss, E.L.: Succint representation of regular languages by boolean automata. Theor. Comput. Sci. 13, 323–330 (1981). https://doi.org/10.1016/S0304-3975(81)80005-9
4. Yu, S., Zhuang, Q.: On the state complexity of intersection of regular languages. SIGACT News 22(3), 52–54 (1991). https://doi.org/10.1145/126537.126543
5. Yu, S., Zhuang, Q., Salomaa, K.: The state complexities of some basic operations on regular languages. Theor. Comput. Sci. 125(2), 315–328 (1994). https://doi.org/10.1016/0304-3975(92)00011-F
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献