The following pages link to Lucian Ilie (Q287019):
Displaying 50 items.
- On a geometric problem of zigzags. (Q287020) (← links)
- The ``runs'' conjecture (Q544875) (← links)
- Generalised fine and Wilf's theorem for arbitrary number of periods (Q557915) (← links)
- The longest common extension problem revisited and applications to approximate string searching (Q616995) (← links)
- Periodic and Sturmian languages (Q844208) (← links)
- Maximal repetitions in strings (Q931723) (← links)
- Computing longest previous factor in linear time and applications (Q963336) (← links)
- Repetitions in strings: algorithms and combinatorics (Q1034529) (← links)
- 2-testability and relabelings produce everything (Q1271607) (← links)
- On well quasi orders of free monoids (Q1275465) (← links)
- On quasi orders of words and the confluence property (Q1276254) (← links)
- On a conjecture about slender context-free languages (Q1334679) (← links)
- On computational complexity of contextual languages (Q1391136) (← links)
- Follow automata. (Q1426009) (← links)
- Reducing NFAs by invariant equivalences. (Q1426461) (← links)
- On strongly context-free languages (Q1570831) (← links)
- On lengths of words in context-free languages (Q1575557) (← links)
- Computing the longest previous factor (Q1761495) (← links)
- On subwords of infinite words (Q1917236) (← links)
- Periods and binary words (Q1971621) (← links)
- On the expressiveness of subset-sum representations (Q1977079) (← links)
- A note on the number of squares in a word (Q2373759) (← links)
- A simple proof that a word of length \(n\) has at most \(2n\) distinct squares (Q2568974) (← links)
- A generalization of repetition threshold (Q2575754) (← links)
- Two-variable word equations (Q2729626) (← links)
- (Q2770678) (← links)
- A comparison of index-based lempel-Ziv LZ77 factorization algorithms (Q2875093) (← links)
- (Q3022290) (← links)
- Minimum Unique Substrings and Maximum Repeats (Q3100935) (← links)
- (Q3396591) (← links)
- (Q3409986) (← links)
- THE STRUCTURE OF FACTOR ORACLES (Q3503093) (← links)
- The Lempel–Ziv Complexity of Fixed Points of Morphisms (Q3503229) (← links)
- Towards a Solution to the “Runs” Conjecture (Q3506961) (← links)
- Analysis of Maximal Repetitions in Strings (Q3525593) (← links)
- LPF Computation Revisited (Q3651543) (← links)
- (Q3837990) (← links)
- (Q4226191) (← links)
- (Q4254836) (← links)
- (Q4265628) (← links)
- Binary self-adding sequences and languages<sup>1</sup> (Q4332450) (← links)
- (Q4355685) (← links)
- (Q4358449) (← links)
- Languages obtained from infinite words (Q4385675) (← links)
- (Q4418648) (← links)
- (Q4453228) (← links)
- (Q4453440) (← links)
- A characterization of poly-slender context-free languages (Q4494483) (← links)
- (Q4501527) (← links)
- (Q4708581) (← links)
