Результаты исследований: Публикации в книгах, отчётах, сборниках, трудах конференций › статья в сборнике материалов конференции › научная › Рецензирование
Towards Exact State Complexity Bounds for Input-Driven Pushdown Automata. / Jirásková, Galina; Okhotin, Alexander.
Developments in Language Theory - 22nd International Conference, DLT 2018, Proceedings. ред. / Mizuho Hoshi; Shinnosuke Seki. Springer Nature, 2018. стр. 441-452 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Том 11088 LNCS).Результаты исследований: Публикации в книгах, отчётах, сборниках, трудах конференций › статья в сборнике материалов конференции › научная › Рецензирование
}
TY - GEN
T1 - Towards Exact State Complexity Bounds for Input-Driven Pushdown Automata
AU - Jirásková, Galina
AU - Okhotin, Alexander
PY - 2018/1/1
Y1 - 2018/1/1
N2 - The paper improves several state complexity bounds for input-driven pushdown automata (IDPDA), also known as visibly pushdown automata. For deterministic IDPDA it is proved that the number of states sufficient and in the worst case necessary to represent the reversal of an n-state automaton is exactly if all inputs are assumed to be well-nested, and between and (formula presented) without this restriction, cf. (formula presented) in the literature. For the concatenation of an m-state and an n-state IDPDA, the new lower bound is which is asymptotically tight for well-nested inputs. Without this restriction, the state complexity is between and Finally, it is proved that transforming an n-state nondeterministic IDPDA to a deterministic one requires exactly states, cf. in the literature; the known lower bounds on complementing nondeterministic IDPDA and on transforming them to unambiguous are also improved.
AB - The paper improves several state complexity bounds for input-driven pushdown automata (IDPDA), also known as visibly pushdown automata. For deterministic IDPDA it is proved that the number of states sufficient and in the worst case necessary to represent the reversal of an n-state automaton is exactly if all inputs are assumed to be well-nested, and between and (formula presented) without this restriction, cf. (formula presented) in the literature. For the concatenation of an m-state and an n-state IDPDA, the new lower bound is which is asymptotically tight for well-nested inputs. Without this restriction, the state complexity is between and Finally, it is proved that transforming an n-state nondeterministic IDPDA to a deterministic one requires exactly states, cf. in the literature; the known lower bounds on complementing nondeterministic IDPDA and on transforming them to unambiguous are also improved.
UR - http://www.scopus.com/inward/record.url?scp=85053876150&partnerID=8YFLogxK
U2 - 10.1007/978-3-319-98654-8_36
DO - 10.1007/978-3-319-98654-8_36
M3 - Conference contribution
AN - SCOPUS:85053876150
SN - 9783319986531
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 441
EP - 452
BT - Developments in Language Theory - 22nd International Conference, DLT 2018, Proceedings
A2 - Hoshi, Mizuho
A2 - Seki, Shinnosuke
PB - Springer Nature
T2 - 22nd International Conference on Developments in Language Theory, DLT 2018
Y2 - 10 September 2018 through 14 September 2018
ER -
ID: 41137532