81 search results - page 1 / 17 » A Formalisation of Finite Automata Using Hereditarily Finite... |
CORR
2008
Springer
13 years 4 months ago
2008
Springer
Prolog's ability to return multiple answers on backtracking provides an elegant mechanism to derive reversible encodings of combinatorial objects as Natural Numbers i.e. ranki...
CORR
2008
Springer
2008
Springer
Declarative Combinatorics: Isomorphisms, Hylomorphisms and Hereditarily Finite Data Types in Haskell
13 years 4 months ago
This paper is an exploration in a functional programming framework of isomorphisms between elementary data types (natural numbers, sets, finite functions, permutations binary deci...
LICS
1999
IEEE
13 years 8 months ago
1999
IEEE
The ordered conjecture states that least fixed-point logic LFP is strictly more expressive than first-order logic FO on every infinite class of ordered finite structures. It has b...
JUCS
2002
13 years 4 months ago
2002
: In this paper, we present a fast and simple algorithm for constructing a minimal acyclic deterministic finite automaton from a finite set of words. Such automata are useful in a ...
CORR
2010
Springer
13 years 4 months ago
2010
Springer
This article studies the expressive power of finite automata recognizing sets of real numbers encoded in positional notation. We consider Muller automata as well as the restricted ...