Results 1  10
of
5,166
A Structural Approach to Operational Semantics
, 1981
"... Syntax of a very simple programming language called L. What is abstract about it will be discussed a little here and later at greater length. For us syntax is a collection of syntactic sets of phrases; each set corresponds to a different type of phrase. Some of these sets are very simple and can be ..."
Abstract

Cited by 1541 (3 self)
 Add to MetaCart
Syntax of a very simple programming language called L. What is abstract about it will be discussed a little here and later at greater length. For us syntax is a collection of syntactic sets of phrases; each set corresponds to a different type of phrase. Some of these sets are very simple and can be taken as given: Truthvalues This is the set T = ftt; ffg and is ranged over by (the metavariable) t (and we also happily employ for this (and any other) metavariable sub and superscripts to generate other metavariables: t ; t 0 ; t 1k ).
A maximum likelihood approach to continuous speech recognition
 IEEE Trans. Pattern Anal. Machine Intell
, 1983
"... AbstractSpeech recognition is formulated as a problem of maximum likelihood decoding. This formulation requires statistical models of the speech production process. In this paper, we describe a number of statistical models for use in speech recognition. We give special attention to determining the ..."
Abstract

Cited by 472 (9 self)
 Add to MetaCart
the parameters for such models from sparse data. We also describe two decoding methods, one appropriate for constrained artificial languages and one appropriate for more realistic decoding tasks. To illustrate the usefulness of the methods described, we review a number of decoding results that have been obtained
Regular models of phonological rule systems
, 1994
"... This paper presents a set of mathematical and computational tools for manipulating and reasoning about regular languages and regular relations and argues that they provide a solid basis for computational phonology. It shows in detail how this framework applies to ordered sets of contextsensitive re ..."
Abstract

Cited by 379 (6 self)
 Add to MetaCart
sensitive rewriting rules and also to grammars in Koskenniemi's twolevel formalism. This analysis provides a common representation of phonological constraints that supports efficient generation and recognition by a single simple interpreter.
Transition Network Grammars for Natural Language Analysis
 COMPUTATIONAL LINGUISTICS, D.G. BOBROW, EDITOR
, 1970
"... The use of augmented transition network grammars for the analysis of natural language sentences is described. Structurebuilding actions associated with the arcs of the grammar network allow for the reordering, restructuring, and copying of constituents necessary to produce deepstructure representa ..."
Abstract

Cited by 323 (3 self)
 Add to MetaCart
The use of augmented transition network grammars for the analysis of natural language sentences is described. Structurebuilding actions associated with the arcs of the grammar network allow for the reordering, restructuring, and copying of constituents necessary to produce deepstructure representations of the type normally obtained from a transformational analysis, and conditions on the arcs allow for a powerful selectivity which can rule out meaningless analyses and take advantage of semantic information to guide the parsing. The advantages of this model for natural language analysis are discussed in detail and illustrated by examples. An implementation of an experimental parsing system for transition network grammars is briefly described.
Conjugacy and equivalence of weighted automata and functional transducers
 Proc. of CSR’06, volume 3967 of Lecture Notes in Computer Science
, 2006
"... Abstract. We show that two equivalent Kautomata are conjugate to a third one, when K is equal to B, N, Z, or any (skew) field and that the same holds true for functional tranducers as well. 1 Presentation of the results In a recent paper ([1]), we have studied the equivalence of Zautomata. This eq ..."
Abstract

Cited by 20 (4 self)
 Add to MetaCart
Abstract. We show that two equivalent Kautomata are conjugate to a third one, when K is equal to B, N, Z, or any (skew) field and that the same holds true for functional tranducers as well. 1 Presentation of the results In a recent paper ([1]), we have studied the equivalence of Zautomata
On the Equivalence of Finite Substitutions and Transducers
, 1999
"... This paper discusses on several variants of a fascinating problem of deciding whether two finite substitutions are equivalent on a regular language, as well as its relations to the equivalence problems of sequential transducers. Among other things it is proved to be decidable whether for a regular l ..."
Abstract
 Add to MetaCart
This paper discusses on several variants of a fascinating problem of deciding whether two finite substitutions are equivalent on a regular language, as well as its relations to the equivalence problems of sequential transducers. Among other things it is proved to be decidable whether for a regular
On the equivalence of Zautomata
 In ICALP 2005 (2005
"... Abstract. We prove that two automata with multiplicity in Z are equivalent, i.e. define the same rational series, if and only if there is a sequence of Zcoverings, coZcoverings, and circulations of −1, which transforms one automaton into the other. Moreover, the construction of these transformati ..."
Abstract

Cited by 14 (3 self)
 Add to MetaCart
Abstract. We prove that two automata with multiplicity in Z are equivalent, i.e. define the same rational series, if and only if there is a sequence of Zcoverings, coZcoverings, and circulations of −1, which transforms one automaton into the other. Moreover, the construction
Equivalence of deterministic nested word to word transducers
 In FCT, volume 5699 of LNCS
, 2009
"... Abstract. We study the equivalence problem of deterministic nested word to word transducers and show it to be surprisingly robust. Modulo polynomial time reductions, it can be identified with 4 equivalence problems for diverse classes of deterministic noncopying orderpreserving transducers. In par ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
. In particular, we present polynomial time back and fourth reductions to the morphism equivalence problem on context free languages, which is known to be solvable in polynomial time. Keywords: trees, transducers, automata, contextfree grammars, XML. 1
Transducers and repetitions
 Theoretical Computer Science
, 1986
"... Abstract. The factor transducer of a word associates to each of its factors (or subwc~rds) their first occurrence. Optimal bounds on the size of minimal factor transducers together with an algorithm for building them are given. Analogue results and a simple algorithm are given for the case of subseq ..."
Abstract

Cited by 94 (18 self)
 Add to MetaCart
Abstract. The factor transducer of a word associates to each of its factors (or subwc~rds) their first occurrence. Optimal bounds on the size of minimal factor transducers together with an algorithm for building them are given. Analogue results and a simple algorithm are given for the case
Results 1  10
of
5,166