Monthly Archives: November 2013

SEO-Friendly URL Structure

A URL (uniform resource locator), also known as web address, is a reference to a resource such as a webpage. For example, the URL to this showing webpage is the following: Clean and structured URLs help both users and search

Tagged with:
Posted in Web

Context-Free Languages

A context-free grammar is a tuple \(G=(V, \Sigma, P, S)\) where \(V\) is a finite set of variables, \(\Sigma\) is an alphabet with a finite set of symbols which are called terminals, \(P\) is a finite set of production rules,

Tagged with: , , ,
Posted in Theory

Regular Languages and Finite Automata

Language An alphabet \(\Sigma\) is a finite set of symbols, for example \(\Sigma=\{0,1\}\). A string is a finite sequence of symbols from \(\Sigma\). We denote the empty string by \(\epsilon\). The set of all strings over \(\Sigma\) is \(\Sigma^\star\), using

Tagged with: , ,
Posted in Theory

SEO for Startups

Search engine optimization (SEO) is the most important marketing strategy for startups. The following are a list of SEO advices for startups, or websites with not too many pages. Unify URLs with 301 Redirect Websites may choose URLs either starting

Tagged with: , ,
Posted in Web