Results 1 - 10 of 98

Common Subsequence Automaton

by Zdenek Tronicek , 2002
"... Given a set of strings, a common subsequence of this set is a string that is a subsequence of each string in this set. We describe an on-line algorithm building the nite automaton which accepts all common subsequences of the given set of strings. ..."
Abstract - Cited by 4 (0 self) - Add to MetaCart
Given a set of strings, a common subsequence of this set is a string that is a subsequence of each string in this set. We describe an on-line algorithm building the nite automaton which accepts all common subsequences of the given set of strings.

The Complexity of Probabilistic versus Deterministic Finite Automata

by Andris Ambainis - Proceedings of the International Symposium on Algorithms and Computation (ISAAC'96), Lecture Notes in Computer Science 1178 , 1996
"... . We show that there exists probabilistic nite automata with an isolated cutpoint and n states such that the smallest equivalent deterministic nite automaton contains (2 n log log n log n ) states. Keywords: Automata theory, the complexity of nite automata, probabilistic nite automata. 1 Introd ..."
Abstract - Cited by 11 (2 self) - Add to MetaCart
. We show that there exists probabilistic nite automata with an isolated cutpoint and n states such that the smallest equivalent deterministic nite automaton contains (2 n log log n log n ) states. Keywords: Automata theory, the complexity of nite automata, probabilistic nite automata. 1

Computing the Prefix of an Automaton

by Marie-Pierre Béal, Olivier Carton , 2000
"... We present an algorithm for computating the prex of an automaton. Automata considered are non-deterministic, labelled on words, and can have "-transitions. The prex automaton of an automaton A has the following properties. It has the same graph as A. Each accepting path has the same label a ..."
Abstract - Cited by 3 (0 self) - Add to MetaCart
We present an algorithm for computating the prex of an automaton. Automata considered are non-deterministic, labelled on words, and can have "-transitions. The prex automaton of an automaton A has the following properties. It has the same graph as A. Each accepting path has the same label

A Fixed-point Characterization of a Deontic Logic of Regular Action

by Jan Broersen, Roel Wieringa, John-jules Meyer - Fundamenta Informaticae , 2001
"... We dene a deontic logic of regular action as a characterization within a modal -calculus of action. First a semantics of deontic notions for regular action is given in terms of conditions on modal action structures. Then modal -calculus formulas characterizing these conditions are constructed by ..."
Abstract - Cited by 15 (0 self) - Add to MetaCart
by closely following the structure of deterministic nite automatons for regular action. Keywords: ought-to-do norms, dynamic deontic logic, modal action logic, -calculus, nite automatons, regular actions, free choice permission 1

The MSO Logic-Automaton Connection in Linguistics

by Frank Morawietz, Tom Cornell - Logical Aspects of Computational Linguistics, LNCS 1582 , 1999
"... . In this paper we discuss possible applications of a system which uses automata-based theorem-proving techniques drawing on the decidability proof for weak monadic second-order (MSO) logic on trees to implement linguistic processing and theory verication. Despite a staggering complexity bound, the ..."
Abstract - Cited by 4 (0 self) - Add to MetaCart
nite, deterministic tree automata oers a way of combining the needs of both formalization and processing. The aim of this paper is threefold. Firstly we show how to use this technique for the verication of separate modules of a Principles-and-Parameters (P&P) grammar and secondly

Text Compression with Random Access

by Jirí Dvorsky
"... Compression method based on nite automatons is presented in this paper. Simple algorithm for construction nite automaton for given regular expression is shown. The best advantage of this algorithm is the possibility of random access to a compressed text. The compression ratio achieved is fairly good ..."
Abstract - Cited by 1 (0 self) - Add to MetaCart
Compression method based on nite automatons is presented in this paper. Simple algorithm for construction nite automaton for given regular expression is shown. The best advantage of this algorithm is the possibility of random access to a compressed text. The compression ratio achieved is fairly

Modifying the upper bound on the length of minimal synchronizing word

by A N Trahtman - LNCS
"... Abstract. A word w is called synchronizing (recurrent, reset, magic, directable) word of deterministic nite automaton (DFA) if w sends all states of the automaton to a unique state. In 1964 Jan Cerny found a sequence of n-state complete DFA possessing a minimal synchronizing word of length ..."
Abstract - Cited by 13 (2 self) - Add to MetaCart
Abstract. A word w is called synchronizing (recurrent, reset, magic, directable) word of deterministic nite automaton (DFA) if w sends all states of the automaton to a unique state. In 1964 Jan Cerny found a sequence of n-state complete DFA possessing a minimal synchronizing word of length

An Automaton Model of User-Controlled Navigation on the Web

by K. Lodaya, R. Ramanujam
"... We present a simple theoretical model of web navigation, in which each WWW user creates style specications which constrain web browsing, search and navigation using the user's own judgement of the quality of visited sites. A nite state automaton is associated with each specication, which is ..."
Abstract - Add to MetaCart
We present a simple theoretical model of web navigation, in which each WWW user creates style specications which constrain web browsing, search and navigation using the user's own judgement of the quality of visited sites. A nite state automaton is associated with each specication, which

A CRITERION FOR NON-AUTOMATICITY OF SEQUENCES

by Jan-christoph Schlage-Puchta , 2003
"... We give a criterion for a sequence (a n ) n1 to be non-automatic, i.e., for when there does not exist a nite automaton generating this sequence. As application we generalize a result of Yazdani on the non-automaticity of multiplicative sequences. ..."
Abstract - Add to MetaCart
We give a criterion for a sequence (a n ) n1 to be non-automatic, i.e., for when there does not exist a nite automaton generating this sequence. As application we generalize a result of Yazdani on the non-automaticity of multiplicative sequences.

On-Line Odometers for Two-Sided Symbolic Dynamical Systems

by Christiane Frougny
"... We consider biin nite sequences on a nite alphabet of digits which satisfy a constraint of nite type. Such sequences are perturbed by adding a 1 in position 0. The odometer is the function which transforms the initial sequence into an admissible sequence equivalent to the perturbed one. It is ..."
Abstract - Cited by 4 (0 self) - Add to MetaCart
. It is shown that the odometer can be realized by an on-line nite automaton when the constraint is linked to numeration in base , where is a Pisot number satisfying the equation = t1 + +tm , where t1 t2 tm 1 are integers.
Results 1 - 10 of 98