| 2023-10 |
ARED: automata-based runtime estimation for distributed systems using deep learning |
Cluster Computing
|
| 2023-09 |
On Simon's congruence closure of a string |
Theoretical Computer Science
|
| 2023-05 |
An Empirical Study on Multimodal Activity Clustering of Android Applications |
IEEE Access
|
| 2023-01 |
Deciding path size of nondeterministic (and input-driven) pushdown automata |
Theoretical Computer Science
|
| 2022-04 |
뉴럴 네트워크를 활용한 지식 정보 검색 연구 현황 |
디지털문화아카이브지
|
| 2022-04 |
신장 트리 오토마타 기반의 효율적인 Markush 화합물 매칭 알고리즘 |
정보과학회 컴퓨팅의 실제 논문지
|
| 2021-08 |
Left is better than right for reducing nondeterminism of NFAs |
INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE
|
| 2021-08 |
Generalizations of Code Languages with Marginal Errors |
INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE
|
| 2021-08 |
Consensus string problem for multiple regular languages |
INFORMATION AND COMPUTATION
|
| 2021-05 |
A general architecture of oritatami systems for simulating arbitrary finite automata |
THEORETICAL COMPUTER SCIENCE
|
| 2021-03 |
Closest substring problems for regular languages |
THEORETICAL COMPUTER SCIENCE
|
| 2020-06 |
Transcript design problem of oritatami systems |
NATURAL COMPUTING
|
| 2019-12 |
Site-directed insertion: Language equations and decision problems |
THEORETICAL COMPUTER SCIENCE
|
| 2019-11 |
Bound-decreasing duplication system |
THEORETICAL COMPUTER SCIENCE
|
| 2019-10 |
Alignment distance of regular tree languages |
THEORETICAL COMPUTER SCIENCE
|
| 2019-09 |
Self-Attraction Removal from Oritatami Systems |
INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE
|
| 2019-09 |
Ruleset optimization on isomorphic oritatami systems |
THEORETICAL COMPUTER SCIENCE
|
| 2018-09 |
An abusive text detection system based on enhanced abusive and non-abusive word lists |
DECISION SUPPORT SYSTEMS
|
| 2018-03 |
Nondeterministic seedless oritatami systems and hardness of testing their equivalence |
NATURAL COMPUTING
|
| 2017-11 |
Outfix-guided insertion |
THEORETICAL COMPUTER SCIENCE
|
| 2017-10 |
Pseudoknot-generating operation |
THEORETICAL COMPUTER SCIENCE
|
| 2017-08 |
State complexity of k-parallel tree concatenation |
FUNDAMENTA INFORMATICAE
|
| 2017-06 |
State complexity of permutation on finite languages over a binary alphabet |
THEORETICAL COMPUTER SCIENCE
|
| 2017-05 |
Ambiguity, nondeterminism and state complexity of finite automata |
Acta Cybernetica
|
| 2016-12 |
State Complexity of Regular Tree Languages for Tree Matching |
INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE
|
| 2016-11 |
State complexity of insertion |
INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE
|
| 2016-09 |
Operational State Complexity of Subtree-Free Regular Tree Languages |
INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE
|
| 2016-05 |
Duplications and pseudo-duplications |
INTERNATIONAL JOURNAL OF UNCONVENTIONAL COMPUTING
|
| 2016-04 |
OMPPM: Online multiple palindrome pattern matching |
BIOINFORMATICS
|
| 2016-04 |
Approximate matching between a context-free grammar and a finite-state automaton |
INFORMATION AND COMPUTATION
|
| 2016-03 |
State Complexity of Basic Operations on Non-Returning Regular Languages |
FUNDAMENTA INFORMATICAE
|
| 2016-03 |
Pseudo-inversion: closure properties and decidability |
NATURAL COMPUTING
|
| 2016-02 |
State complexity of deletion and bipolar deletion |
ACTA INFORMATICA
|
| 2016-01 |
State complexity of inversion operations |
THEORETICAL COMPUTER SCIENCE
|
| 2015-11 |
State complexity of Kleene-star operations on regular tree languages |
Acta Cybernetica
|
| 2015-09 |
State Complexity of Boundary of Prefix-Free Regular Language |
INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE
|
| 2015-08 |
Non-overlapping inversion on strings and languages |
THEORETICAL COMPUTER SCIENCE
|
| 2015-07 |
A Recommendation Model Using the Bandwagon Effect for E-Marketing Purposes in IoT |
INTERNATIONAL JOURNAL OF DISTRIBUTED SENSOR NETWORKS
|
| 2015-04 |
Alignment with non-overlapping inversions and translocations on two strings |
THEORETICAL COMPUTER SCIENCE
|
| 2015-02 |
State Complexity of k-Union and k-Intersection for Prefix-Free Regular Languages |
INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE
|
| 2014-09 |
Decidability of involution hypercodes |
THEORETICAL COMPUTER SCIENCE
|
| 2014-06 |
A Speculative Parallel DFA Membership Test for Multicore, SIMD and Cloud Computing Environments |
INTERNATIONAL JOURNAL OF PARALLEL PROGRAMMING
|
| 2013-11 |
THE EDIT-DISTANCE BETWEEN A REGULAR LANGUAGE AND A CONTEXT-FREE LANGUAGE |
INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE
|
| 2013-11 |
State Elimination Heuristics for Short Regular Expressions |
FUNDAMENTA INFORMATICAE
|
| 2013-10 |
State complexity of combined operations for suffix-free regular languages |
THEORETICAL COMPUTER SCIENCE
|
| 2013-08 |
AN IMPROVED PREFIX-FREE REGULAR-EXPRESSION MATCHING |
INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE
|
| 2013-03 |
Representative reviewers for Internet social media |
Expert Systems with Applications
|
| 2012-09 |
Analysis of a cellular automaton model for car traffic with a junction |
THEORETICAL COMPUTER SCIENCE
|
| 2012-07 |
A movie recommendation algorithm based on genre correlations |
Expert Systems with Applications
|
| 2012-06 |
정규 언어와 문맥 자유 언어 사이의 편집 거리 계산 |
정보과학회논문지 : 컴퓨팅의 실제 및 레터
|
| 2012-04 |
COMPUTING USER REPUTATION IN A SOCIAL NETWORK OF WEB 2.0 |
COMPUTING AND INFORMATICS
|
| 2011-08 |
OVERLAP-FREE LANGUAGES AND SOLID CODES |
INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE
|
| 2010-09 |
Ranking Parameters based on Social Network for User-generated Video Contents |
Information-An International Interdisciplinary Journal
|
| 2010-03 |
On the Linear Number of Matching Substrings |
Journal Of Universal Computer Science
|
| 2009-08 |
Nondeterministic state complexity of nested word automata |
Theoretical Computer Science
|
| 2009-06 |
State complexity of basic operations on suffix-free regular languages |
Theoretical Computer Science
|
| 2009-03 |
Nondeterministic State Complexity of Basic Operations for Prefix-Free Regular Languages |
Fundamenta Informaticae
|
| 2008-09 |
Generalizations of 1-deterministic regular languages |
Information And Computation
|
| 2007-01 |
Prefix-free regular languages and pattern matching |
THEORETICAL COMPUTER SCIENCE
|