scispace - formally typeset
Search or ask a question
Topic

Continuous automaton

About: Continuous automaton is a research topic. Over the lifetime, 947 publications have been published within this topic receiving 17417 citations.


Papers
More filters
Journal ArticleDOI
TL;DR: This paper presents the first algorithm for LZ trie construction that runs in effectively linear time thereby making it an attractive choice for finite‐state automata implementation and presents two variants of the construction procedure – an optimal method regarding the final size and a method that sacrifices some compression for low intermediate memory usage.
Abstract: Finite-state automata are important components in information retrieval and natural language processing software. A recursive automaton is the most compact representation of the acyclic deterministic finite-state automata. It is based on merging not only the equivalent states but also the identical substructures in an automaton. The LZ trie variant is the state-of-the-art in automata compression regarding space, but the time needed for its construction was, until now, quadratic, which has made it impractical for large inputs. In this paper, we present the first algorithm for LZ trie construction that runs in effectively linear time thereby making it an attractive choice for finite-state automata implementation. We achieve this goal by adding a new functionality to the enhanced suffix array data structure. We present two variants of the construction procedure - an optimal method regarding the final size and a method that sacrifices some compression for low intermediate memory usage. We have made the implementation of our algorithms available in an open source software package LzLex.Copyright © 2014 John Wiley & Sons, Ltd.

4 citations

Proceedings ArticleDOI
24 Mar 2010
TL;DR: Through solving the Travelling Salesman Problem, the effectiveness of the proposed model in implementing a LCA is shown and a better simulation of complex adaptive systems can be envisaged.
Abstract: Cellular automata (CA) have been shown to be suitable for modelling and simulating complex adaptive systems. To achieve adaptation to the exterior environment, Learning Cellular Automata (LCA) have been proposed as an extension of traditional CA, which exhibit only local adaptation, in order to allow a global adaptation of the automaton to its environment. In this paper, a new variant of LCA is described. It relies on two main ideas: The first one is to enhance the learning capabilities of the cellular automaton by using new operations inspired from the Reynolds’s Boids model and the second one is to foster diversity of cells' states within the cellular automaton by adopting a quantum representation of the CA cells. Through solving the Travelling Salesman Problem, we show the effectiveness of the proposed model in implementing a LCA. Therefore a better simulation of complex adaptive systems can be envisaged.

4 citations

Proceedings ArticleDOI
10 Aug 1998
TL;DR: A transformation algorithm which tracks, for each node of an automaton under construction, the larcs which it reflects and the lattice nodes at their origins and extremities and has been successfully applied to lattices derived from dictionaries.
Abstract: The problem of transforming a lattice into a non-deterministic finite state automaton is non-trivial. We present a transformation algorithm which tracks, for each node of an automaton under construction, the larcs which it reflects and the lattice nodes at their origins and extremities. An extension of the algorithm permits the inclusion of null, or epsilon, arcs in the output automaton. The algorithm has been successfully applied to lattices derived from dictionaries, i.e. very large corpora of strings.

4 citations

Book ChapterDOI
06 Sep 1976
TL;DR: In this work, certain decompositions of a finite automaton are studied in relationship with the factorisations of a polynomial associated to it.
Abstract: We study certain decompositions of a finite automaton in relationship with the factorisations of a polynomial associated to it.

4 citations

Network Information
Related Topics (5)
Time complexity
36K papers, 879.5K citations
81% related
Graph (abstract data type)
69.9K papers, 1.2M citations
77% related
Approximation algorithm
23.9K papers, 654.3K citations
77% related
Graph theory
20.8K papers, 691.4K citations
76% related
Computational complexity theory
30.8K papers, 711.2K citations
76% related
Performance
Metrics
No. of papers in the topic in previous years
YearPapers
20232
202219
20212
20192
20184
201719