Results 1 - 10 of 168

The complexity of theorem-proving procedures

by Stephen A. Cook - IN STOC , 1971
"... It is shown that any recognition problem solved by a polynomial time-bounded nondeterministic Turing machine can be “reduced” to the problem of determining whether a given propositional formula is a tautology. Here “reduced ” means, roughly speaking, that the first problem can be solved deterministi ..."
Abstract - Cited by 1050 (5 self) - Add to MetaCart
deterministically in polynomial time provided an oracle is available for solving the second. From this notion of reducible, polynomial degrees of difficulty are defined, and it is shown that the problem of determining tautologyhood has the same polynomial degree as the problem of determining whether the first

Deterministic Part-of-Speech Tagging with Finite-State Transducers

by Emmanuel Roche, Yves Schabes - Computational Linguistics , 1995
"... Stochastic approaches to natural language processing have often been preferred to rule-based approaches because of their robustness and their automatic training capabilities. This was the case for part-of-speech tagging until Brill showed how state-of-the-art part-of-speech tagging can be achieved w ..."
Abstract - Cited by 96 (0 self) - Add to MetaCart
that the time to assign tags to a sentence corresponds to the time required to follow a single path in a deterministic finite-state machine. This result is achieved by encoding the application of the rules found in the tagger as a nondeterministic finite-state transducer and then turning it into a deterministic

Comparing nondeterministic and quasideterministic finite-state transducers built from morphological dictionaries ∗

by Alicia Garrido-alenda, Mikel L. Forcada
"... Resumen: Se presenta una comparación entre transductores de estados finitos cuasideterministas y no deterministas generados a partir de diccionarios morfológicos que contienen el vocabulario (lemas) y la información sobre flexión morfológica de una aplicación de procesamiento del lenguaje natural ta ..."
Abstract - Cited by 1 (0 self) - Add to MetaCart
: This paper describes a comparison between quasideterministic and nondeterministic finite-state transducers generated from morphological dictionaries containing the vocabulary (lemmas) and the morphological inflection information of a natural language processing application such as the morphological analyser

A Non-deterministic Tokeniser for Finite-State Parsing

by Jean-Pierre Chanod Rank, Jean-pierre Chanod, Pasi Tapanainen - In Proceedings of the Workshop on Extended , 1996
"... This paper describes a non-deterministic tokeniser implemented and used for the development of a French finite-state grammar. The tokeniser includes a finite-state automaton for simple tokens and a lexical transducer that encodes a wide variety of multiword expressions, associated with multiple lexi ..."
Abstract - Add to MetaCart
This paper describes a non-deterministic tokeniser implemented and used for the development of a French finite-state grammar. The tokeniser includes a finite-state automaton for simple tokens and a lexical transducer that encodes a wide variety of multiword expressions, associated with multiple

A Non-deterministic Tokeniser for Finite-State Parsing

by Jean-pierre Chanod, Pasi Tapanainen - In Proceedings of the Workshop on Extended , 1996
"... This paper describes a non-deterministic tokeniser implemented and used for the development of a French finite-state grammar. The tokeniser includes a finite-state automaton for simple tokens and a lexical transducer that encodes a wide variety of multiword expressions, associated with multiple lexi ..."
Abstract - Cited by 10 (1 self) - Add to MetaCart
This paper describes a non-deterministic tokeniser implemented and used for the development of a French finite-state grammar. The tokeniser includes a finite-state automaton for simple tokens and a lexical transducer that encodes a wide variety of multiword expressions, associated with multiple

MSO definable string transductions and two-way finite-state transducers

by Joost Engelfriet, Hendrik Jan Hoogeboom - ACM Trans. Comput. Logic , 2001
"... String transductions that are definable in monadic second-order (mso) logic (without the use of parameters) are exactly those realized by deterministic two-way finite state transducers. Nondeterministic mso definable string transductions (i.e., those definable with the use of parameters) correspond ..."
Abstract - Cited by 30 (3 self) - Add to MetaCart
String transductions that are definable in monadic second-order (mso) logic (without the use of parameters) are exactly those realized by deterministic two-way finite state transducers. Nondeterministic mso definable string transductions (i.e., those definable with the use of parameters) correspond

An Efficient Implementation of Phonological Rules using Finite-State Transducers

by I. Lee Hetherington, Using Finite-state Transducers , 2001
"... Context-dependent phonological rules are used to model the mapping from phonemes to their varied phonetic surface realizations. Others, most notably Kaplan and Kay, have described how to compile general context-dependent phonological rewrite rules into finite-state transducers. Such rules are very p ..."
Abstract - Cited by 36 (5 self) - Add to MetaCart
Context-dependent phonological rules are used to model the mapping from phonemes to their varied phonetic surface realizations. Others, most notably Kaplan and Kay, have described how to compile general context-dependent phonological rewrite rules into finite-state transducers. Such rules are very

Multi-Head Finite Automata: Data-Independent Versus Data-Dependent Computations

by Markus Holzer - in Proc. Mathematical Foundations of Computer Science, 1997, LNCS 1295, Springer-Verlag
"... . We develop a framework on multi-head finite automata that allows us to study the relation of parallel logarithmic time and sequential logarithmic space in a uniform and nonuniform setting in more detail. In both settings it turns out that NC 1 requires data-independent computations---the movemen ..."
Abstract - Cited by 6 (1 self) - Add to MetaCart
---the movement of the input-heads only depends on the length of the input---whereas logarithmic space is caught with datadependent computations on multi-head finite state machines. This shed new light on the question whether these two classes coincide or not. 1 Introduction Many important questions

From nondeterministic Büchi and Streett automata to deterministic parity automata

by Nir Piterman - In 21st Symposium on Logic in Computer Science (LICS’06 , 2006
"... Determinization and complementation are fundamental notions in computer science. When considering finite automata on finite words determinization gives also a solution to complementation. Given a nondeterministic finite automaton there exists an exponential construction that gives a deterministic au ..."
Abstract - Cited by 74 (5 self) - Add to MetaCart
, we reconsider Safra’s determinization constructions. We show how to construct automata with fewer states and, most importantly, parity acceptance condition. Specifically, starting from a nondeterministic Büchi automaton with n states our construction yields a deterministic parity automaton with n 2n

Model abstraction of nondeterministic finite-state automata in supervisor synthesis Citation for published version (APA): Model Abstraction of Nondeterministic Finite-State Automata in Supervisor Synthesis

by Schuppen, van, J. H R Su , J E Rooda , Rong Su , Member, IEEE Jan H Van Schuppen , Member, IEEE Jacobus E Rooda
"... Please check the document version of this publication: • A submitted manuscript is the version of the article upon submission and before peer-review. There can be important differences between the submitted version and the official published version of record. People interested in the research are ..."
Abstract - Add to MetaCart
.e., every event, which is either observable or labels a transition to a marker state, is contained in the alphabet of abstraction. Index Terms-Automaton abstraction, discrete-event systems, nondeterministic finite-state automata, supervisor synthesis.
Results 1 - 10 of 168