next up previous contents
Next: Finite State Machines Up: Programming in Tabled Prolog Previous: Parsing of Context Sensitive

Automata Theory in XSB

In this chapter we explore how we can use XSB to understand and implement some of the formal systems of automata theory. We will begin by defining finite state machines (FSM), and exploring executable specifications in XSB of string acceptance, epsilon-free machines, deterministic machines and other interesting notions.


David S. Warren