Results 1  10
of
168
The complexity of theoremproving procedures
 IN STOC
, 1971
"... It is shown that any recognition problem solved by a polynomial timebounded 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 PartofSpeech Tagging with FiniteState Transducers
 Computational Linguistics
, 1995
"... Stochastic approaches to natural language processing have often been preferred to rulebased approaches because of their robustness and their automatic training capabilities. This was the case for partofspeech tagging until Brill showed how stateoftheart partofspeech 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 finitestate machine. This result is achieved by encoding the application of the rules found in the tagger as a nondeterministic finitestate transducer and then turning it into a deterministic
Comparing nondeterministic and quasideterministic finitestate transducers built from morphological dictionaries ∗
"... 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 finitestate 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 Nondeterministic Tokeniser for FiniteState Parsing
 In Proceedings of the Workshop on Extended
, 1996
"... This paper describes a nondeterministic tokeniser implemented and used for the development of a French finitestate grammar. The tokeniser includes a finitestate 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 nondeterministic tokeniser implemented and used for the development of a French finitestate grammar. The tokeniser includes a finitestate automaton for simple tokens and a lexical transducer that encodes a wide variety of multiword expressions, associated with multiple
A Nondeterministic Tokeniser for FiniteState Parsing
 In Proceedings of the Workshop on Extended
, 1996
"... This paper describes a nondeterministic tokeniser implemented and used for the development of a French finitestate grammar. The tokeniser includes a finitestate 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 nondeterministic tokeniser implemented and used for the development of a French finitestate grammar. The tokeniser includes a finitestate automaton for simple tokens and a lexical transducer that encodes a wide variety of multiword expressions, associated with multiple
MSO definable string transductions and twoway finitestate transducers
 ACM Trans. Comput. Logic
, 2001
"... String transductions that are definable in monadic secondorder (mso) logic (without the use of parameters) are exactly those realized by deterministic twoway 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 secondorder (mso) logic (without the use of parameters) are exactly those realized by deterministic twoway 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 FiniteState Transducers
, 2001
"... Contextdependent 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 contextdependent phonological rewrite rules into finitestate transducers. Such rules are very p ..."
Abstract

Cited by 36 (5 self)
 Add to MetaCart
Contextdependent 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 contextdependent phonological rewrite rules into finitestate transducers. Such rules are very
MultiHead Finite Automata: DataIndependent Versus DataDependent Computations
 in Proc. Mathematical Foundations of Computer Science, 1997, LNCS 1295, SpringerVerlag
"... . We develop a framework on multihead 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 dataindependent computationsthe movemen ..."
Abstract

Cited by 6 (1 self)
 Add to MetaCart
the movement of the inputheads only depends on the length of the inputwhereas logarithmic space is caught with datadependent computations on multihead 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
 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 finitestate automata in supervisor synthesis Citation for published version (APA): Model Abstraction of Nondeterministic FiniteState Automata in Supervisor Synthesis
"... Please check the document version of this publication: • A submitted manuscript is the version of the article upon submission and before peerreview. 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 TermsAutomaton abstraction, discreteevent systems, nondeterministic finitestate automata, supervisor synthesis.
Results 1  10
of
168