Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

19

CADE
2015
Springer

favoriteEmaildiscussreport

20views Logical Reasoning» more CADE 2015»

A Formalisation of Finite Automata Using Hereditarily Finite Sets

8 years 10 days ago

A Formalisation of Finite Automata Using Hereditarily Finite Sets

Download www.cl.cam.ac.uk

Abstract. Hereditarily ﬁnite (HF) set theory provides a standard universe of sets, but with no inﬁnite sets. Its utility is demonstrated through a formalisation of the theory of regular languages and ﬁnite automata, including the Myhill-Nerode theorem and Brzozowski’s minimisation algorithm. The states of an automaton are HF sets, possibly constructed by product, sum, powerset and similar operations.

Lawrence C. Paulson

Real-time Traffic

CADE 2015 | Logical Reasoning |

claim paper

Related Content

» Ranking and Unranking of Hereditarily Finite Functions and Permutations

» Declarative Combinatorics Isomorphisms Hylomorphisms and Hereditarily Finite Data Types in...

» FirstOrder Logic vs FixedPoint Logic in Finite Set Theory

» A Fast and Simple Algorithm for Constructing Minimal Acyclic Deterministic Finite Automata

» On the Sets of Real Numbers Recognized by Finite Automata in Multiple Bases

» Recursive Timed Automata

» Building and Using Existing Hunspell Dictionaries and TeX Hyphenators as FiniteState Autom...

» Solving the Satisfiability Problem Using Finite Learning Automata

» Optimal Metric Planning with State Sets in Automata Representation

» Antichains A New Algorithm for Checking Universality of Finite Automata

Post Info
More Details (n/a)

Added	17 Apr 2016
Updated	17 Apr 2016
Type	Journal
Year	2015
Where	CADE
Authors	Lawrence C. Paulson

Comments (0)