The following pages link to Yo-Sub Han (Q247253):
Displaying 50 items.
- Approximate matching between a context-free grammar and a finite-state automaton (Q259082) (← links)
- State complexity of combined operations for suffix-free regular languages (Q392179) (← links)
- Decidability of involution hypercodes (Q401315) (← links)
- Analysis of a cellular automaton model for car traffic with a junction (Q442149) (← links)
- Non-overlapping inversion on strings and languages (Q500959) (← links)
- Site-directed insertion: decision problems, maximality and minimality (Q777987) (← links)
- Obtaining shorter regular expressions from finite-state automata (Q868946) (← links)
- On the existence of prime decompositions (Q880173) (← links)
- State complexity of inversion operations (Q896671) (← links)
- Generalizations of 1-deterministic regular languages (Q948081) (← links)
- State complexity of basic operations on suffix-free regular languages (Q1029324) (← links)
- Online stochastic pattern matching (Q1616966) (← links)
- Transcript design problem of oritatami systems (Q1621140) (← links)
- Construction of geometric structure by oritatami system (Q1621144) (← links)
- Site-directed deletion (Q1622963) (← links)
- Outfix-guided insertion (Q1682857) (← links)
- Pseudo-inversion: closure properties and decidability (Q2003444) (← links)
- Consensus string problem for multiple regular languages (Q2042725) (← links)
- Deciding path size of nondeterministic (and input-driven) pushdown automata (Q2098178) (← links)
- On Simon's congruence closure of a string (Q2112187) (← links)
- On the decidability of infix inclusion problem (Q2163987) (← links)
- How to settle the ReDoS problem: back to the classical automata theory (Q2164733) (← links)
- Limited nondeterminism of input-driven pushdown automata: decidability and complexity (Q2179335) (← links)
- Nondeterministic state complexity of nested word automata (Q2271435) (← links)
- Bound-decreasing duplication system (Q2326408) (← links)
- The relative edit-distance between two input-driven languages (Q2327548) (← links)
- Site-directed insertion: language equations and decision problems (Q2334603) (← links)
- Alignment with non-overlapping inversions and translocations on two strings (Q2339453) (← links)
- State complexity of permutation on finite languages over a binary alphabet (Q2358683) (← links)
- Deduplication on finite automata and nested duplication systems (Q2400964) (← links)
- Self-attraction removal from oritatami systems (Q2400999) (← links)
- Pseudoknot-generating operation (Q2405891) (← links)
- Most pseudo-copy languages are not context-free (Q2695285) (← links)
- Pseudoknot-Generating Operation (Q2794363) (← links)
- Inferring a Relax NG Schema from XML Documents (Q2798737) (← links)
- Frequent Pattern Mining with Non-overlapping Inversions (Q2799167) (← links)
- State Complexity of Kleene-Star Operations on Regular Tree Languages (Q2803055) (← links)
- Outfix-Guided Insertion (Q2817379) (← links)
- Nondeterministic Seedless Oritatami Systems and Hardness of Testing Their Equivalence (Q2835701) (← links)
- State Complexity of Basic Operations on Non-returning Regular Languages (Q2843084) (← links)
- State Complexity of Subtree-Free Regular Tree Languages (Q2843085) (← links)
- State Complexity of k-Union and k-Intersection for Prefix-Free Regular Languages (Q2843086) (← links)
- State Complexity of Deletion (Q2921973) (← links)
- Pseudo-inversion on Formal Languages (Q2945533) (← links)
- Duplications and Pseudo-Duplications (Q2945563) (← links)
- State Complexity of Basic Operations on Non-Returning Regular Languages (Q2968533) (← links)
- State Complexity of Insertion (Q2970209) (← links)
- Edit-Distance Between Visibly Pushdown Languages (Q2971150) (← links)
- State Complexity of Regular Tree Languages for Tree Matching (Q2974061) (← links)
- Computing the Edit-Distance between a Regular Language and a Context-Free Language (Q3167486) (← links)
