Standard

On the state complexity of operations on two-way finite automata. / Jirásková, Galina; Okhotin, Alexander.

In: Information and Computation, Vol. 253, No. 1, 01.04.2017, p. 36-63.

Research output: Contribution to journal › Article › peer-review

Harvard

Jirásková, G & Okhotin, A 2017, 'On the state complexity of operations on two-way finite automata', Information and Computation, vol. 253, no. 1, pp. 36-63. https://doi.org/10.1016/j.ic.2016.12.007, https://doi.org/10.1016/j.ic.2016.12.007

APA

Jirásková, G., & Okhotin, A. (2017). On the state complexity of operations on two-way finite automata. Information and Computation, 253(1), 36-63. https://doi.org/10.1016/j.ic.2016.12.007, https://doi.org/10.1016/j.ic.2016.12.007

Vancouver

Jirásková G, Okhotin A. On the state complexity of operations on two-way finite automata. Information and Computation. 2017 Apr 1;253(1):36-63. https://doi.org/10.1016/j.ic.2016.12.007, https://doi.org/10.1016/j.ic.2016.12.007

Author

Jirásková, Galina ; Okhotin, Alexander. / On the state complexity of operations on two-way finite automata. In: Information and Computation. 2017 ; Vol. 253, No. 1. pp. 36-63.

BibTeX

@article{279f4da53e77451ebf253d1b958f5505,
title = "On the state complexity of operations on two-way finite automata",
abstract = "The paper investigates the effect of basic language-theoretic operations on the number of states in two-way deterministic finite automata (2DFAs). If m and n are the number of states in the 2DFAs recognizing the arguments of the following operations, then their result requires the following number of states: at least m+n−o(m+n) and at most 4m+n+const for union; at least m+n−o(m+n) and at most m+n+1 for intersection; at least Ω(mn)+2Ω()log⁡m and at most 2mm+1⋅2nn+1 for concatenation; at least 1n2n2−1 and at most 2O(nn+1) for Kleene star, square and projections; between n+1 and n+2 for reversal; exactly 2n for inverse homomorphisms. All results are obtained by first establishing high lower bounds on the number of states in any 1DFAs recognizing these languages, and then using these bounds to reason about the size of any equivalent 2DFAs.",
keywords = "Descriptional complexity, State complexity, Two-way automata",
author = "Galina Jir{\'a}skov{\'a} and Alexander Okhotin",
note = "Publisher Copyright: {\textcopyright} 2016 Elsevier Inc.",
year = "2017",
month = apr,
day = "1",
doi = "10.1016/j.ic.2016.12.007",
language = "English",
volume = "253",
pages = "36--63",
journal = "Information and Computation",
issn = "0890-5401",
publisher = "Elsevier",
number = "1",

}

RIS

TY - JOUR

T1 - On the state complexity of operations on two-way finite automata

AU - Jirásková, Galina

AU - Okhotin, Alexander

N1 - Publisher Copyright: © 2016 Elsevier Inc.

PY - 2017/4/1

Y1 - 2017/4/1

N2 - The paper investigates the effect of basic language-theoretic operations on the number of states in two-way deterministic finite automata (2DFAs). If m and n are the number of states in the 2DFAs recognizing the arguments of the following operations, then their result requires the following number of states: at least m+n−o(m+n) and at most 4m+n+const for union; at least m+n−o(m+n) and at most m+n+1 for intersection; at least Ω(mn)+2Ω()log⁡m and at most 2mm+1⋅2nn+1 for concatenation; at least 1n2n2−1 and at most 2O(nn+1) for Kleene star, square and projections; between n+1 and n+2 for reversal; exactly 2n for inverse homomorphisms. All results are obtained by first establishing high lower bounds on the number of states in any 1DFAs recognizing these languages, and then using these bounds to reason about the size of any equivalent 2DFAs.

AB - The paper investigates the effect of basic language-theoretic operations on the number of states in two-way deterministic finite automata (2DFAs). If m and n are the number of states in the 2DFAs recognizing the arguments of the following operations, then their result requires the following number of states: at least m+n−o(m+n) and at most 4m+n+const for union; at least m+n−o(m+n) and at most m+n+1 for intersection; at least Ω(mn)+2Ω()log⁡m and at most 2mm+1⋅2nn+1 for concatenation; at least 1n2n2−1 and at most 2O(nn+1) for Kleene star, square and projections; between n+1 and n+2 for reversal; exactly 2n for inverse homomorphisms. All results are obtained by first establishing high lower bounds on the number of states in any 1DFAs recognizing these languages, and then using these bounds to reason about the size of any equivalent 2DFAs.

KW - Descriptional complexity

KW - State complexity

KW - Two-way automata

UR - http://www.scopus.com/inward/record.url?scp=85008450588&partnerID=8YFLogxK

U2 - 10.1016/j.ic.2016.12.007

DO - 10.1016/j.ic.2016.12.007

M3 - Article

VL - 253

SP - 36

EP - 63

JO - Information and Computation

JF - Information and Computation

SN - 0890-5401

IS - 1

ER -

ID: 7745057