1.1.0

Regular Languages in Neo4j and Cypher explores how nondeterministic finite automata can be represented as graphs, and how path patterns can be used to find words in the regular languages accepted by these automata.

If you have an idea how this page could be improved or a comment send me a mail.