Search Sciweavers | Sciweavers

83

WIA
2004
Springer

142views Artificial Intelligence» more WIA 2004»

On the Complexity of Hopcroft's State Minimization Algorithm

15 years 3 months ago

Abstract. Hopcroft’s algorithm for minimizing a deterministic automaton has complexity O(n log n). We show that this complexity bound is tight. More precisely, we provide a famil...

Jean Berstel, Olivier Carton

claim paper

Read More »

77

click to vote

AMW
2010

133views Knowledge Management» more AMW 2010»

What You Must Remember When Processing Data Words

14 years 11 months ago

Download www.comlab.ox.ac.uk

We provide a Myhill-Nerode-like theorem that characterizes the class of data languages recognized by deterministic finite-memory automata (DMA). As a byproduct of this characteriza...

Michael Benedikt, Clemens Ley, Gabriele Puppis

claim paper

Read More »

104

click to vote

ACL
1996

152views Computational Linguistics» more ACL 1996»

Head Automata and Bilingual Tiling: Translation with Minimal Representations

14 years 11 months ago

Download www.aclweb.org

We present a language model consisting of a collection of costed bidirectional finite state automata associated with the head words of phrases. The model is suitable for increment...

Hiyan Alshawi

claim paper

Read More »

94

click to vote

ISMB
1993

119views Computational Biology» more ISMB 1993»

Minimizing Complexity in Cellular Automata Models of Self-Replication

14 years 11 months ago

Download www.aaai.org

Understanding self-replication from an information processing perspective is important because, amongother things, it can shed light on molecular mechanismsof biological reproduct...

James A. Reggia, Hui-Hsien Chou, Steven L. Armentr...

claim paper

Read More »

82

click to vote

FSTTCS
2009
Springer

106views Software Engineering» more FSTTCS 2009»

Mediating for Reduction (on Minimizing Alternating Büchi Automata)

15 years 4 months ago