HCHyunjoon Cheon
Hyunjoon Cheon
*This is an algorithmically generated author record based on publicly available information.
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Hyunjoon Cheon has a total of 6 co-authors. Here are the top co-authors by number of shared publications:
- Yo-Sub Han
Yonsei University
7 shared publications - Joonghyuk Hahn
Yonsei University
3 shared publications - ChanYeol Park
KISTI
1 shared publication - Jaecheol Ryou
Department of Computer Science and Engineering, Chungnam National University, Daejeon 34134, Republic of Korea
1 shared publication - Jinseung Ryu
Center for Development of Supercomputing System, Korea Institute of Science and Technology Information (KISTI), Daejeon 34141, Republic of Korea
1 shared publication - Sicheol Sung
Yonsei University
1 shared publication
Latest Publications
- 13 January 2024
- Published by Springer Nature in Theory of Computing Systems
- Vol. 68 (3) , 301-321
On the Decidability of Infix Inclusion Problem
- 13 January 2024
- Published by Springer Nature in Theory of Computing Systems
- Vol. 68 (3) , 301-321
On the Decidability of Infix Inclusion Problem
- 10 August 2023
- Published by Springer Nature
- p. 141-152
M-equivalence of Parikh Matrix over a Ternary Alphabet
- 10 August 2023
- Published by Springer Nature
- p. 141-152
M-equivalence of Parikh Matrix over a Ternary Alphabet
- 19 May 2023
- Published by Springer Nature
- p. 61-73
Weak Inverse Neighborhoods of Languages
- 28 May 2022
- Published by Springer Nature
- p. 34-49
How to Settle the ReDoS Problem: Back to the Classical Automata Theory
- 28 May 2022
- Published by Springer Nature
- p. 34-49
How to Settle the ReDoS Problem: Back to the Classical Automata Theory
- 22 April 2021
- Published by Springer Nature in Cluster Computing
- Vol. 26 (5) , 2629-2641
ARED: automata-based runtime estimation for distributed systems using deep learning
- 22 April 2021
- Published by Springer Nature in Cluster Computing
- Vol. 26 (5) , 2629-2641
ARED: automata-based runtime estimation for distributed systems using deep learning
- 26 May 2020
- Published by Springer Nature
- Vol. 12086, 43-54
Computing the Shortest String and the Edit-Distance for Parsing Expression Languages
A distance between two languages is a useful tool to measure the language similarity, and is closely related to the intersection problem as well as the shortest string problem. A parsing expression grammar (PEG) is an unambiguous grammar such that the choice operator selects the first matching in PEG while it can be ambiguous in a context-free grammar. PEGs are also closely related to top-down parsing languages. We consider two problems on parsing expression languages (PELs). One is the r-shortest string problem that decides whether or not a given PEL contains a string of length shorter than r. The other problem is the edit-distance problem of PELs with respect to other language families such as finite languages or regular languages. We show that the r-shortest string problem and the edit-distance problem with respect to finite languages are NEXPTIME-complete, and the edit-distance problem with respect to regular languages is undecidable. In addition, we prove that it is impossible to compute a length bound \(\mathcal {B}(G)\) of a PEG G such that L(G) has a string w of length at most \(\mathcal {B}(G)\).- 26 May 2020
- Published by Springer Nature
- Vol. 12086, 43-54
Computing the Shortest String and the Edit-Distance for Parsing Expression Languages
A distance between two languages is a useful tool to measure the language similarity, and is closely related to the intersection problem as well as the shortest string problem. A parsing expression grammar (PEG) is an unambiguous grammar such that the choice operator selects the first matching in PEG while it can be ambiguous in a context-free grammar. PEGs are also closely related to top-down parsing languages. We consider two problems on parsing expression languages (PELs). One is the r-shortest string problem that decides whether or not a given PEL contains a string of length shorter than r. The other problem is the edit-distance problem of PELs with respect to other language families such as finite languages or regular languages. We show that the r-shortest string problem and the edit-distance problem with respect to finite languages are NEXPTIME-complete, and the edit-distance problem with respect to regular languages is undecidable. In addition, we prove that it is impossible to compute a length bound \(\mathcal {B}(G)\) of a PEG G such that L(G) has a string w of length at most \(\mathcal {B}(G)\).