Parikh’s Theorem is a fundamental result in automata theory with numerous applications in computer science. These include software verification (e.g. infinite-state verification, string constraints, and theory of arrays), verification of cryptographic protocols (e.g. using Horn clauses modulo equational theories) and database querying (e.g. evaluating path-queries in graph databases), among others. Parikh’s Theorem states that the … full description “Parikh’s Theorem for Symbolic Register Automata (available)”
Skip to content
Undergraduate Research Opportunities
Department of Computer Science, Royal Holloway, University of London