Results 1  10
of
464
Inputdriven languages are linear conjunctiveI
"... Linear conjunctive grammars define the same family of languages as oneway realtime cellular automata (A. Okhotin, “On the equivalence of linear conjunctive grammars to trellis automata”, RAIRO ITA, 2004), and this family is known to be incomparable with the contextfree languages (V. Terrier, “On ..."
Abstract
 Add to MetaCart
Linear conjunctive grammars define the same family of languages as oneway realtime cellular automata (A. Okhotin, “On the equivalence of linear conjunctive grammars to trellis automata”, RAIRO ITA, 2004), and this family is known to be incomparable with the contextfree languages (V. Terrier, “On
On the Number of Nonterminals in Linear Conjunctive Grammars
, 2003
"... This paper studies the number of nonterminals in a linear conjunctive grammar as a descriptional complexity measure of this family of languages. It is proved that for every linear conjunctive grammar there exists and can be eectively constructed a linear conjunctive grammar that accepts the same ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
This paper studies the number of nonterminals in a linear conjunctive grammar as a descriptional complexity measure of this family of languages. It is proved that for every linear conjunctive grammar there exists and can be eectively constructed a linear conjunctive grammar that accepts the same
Homomorphisms Preserving Trellis Languages
 JOURNAL OF AUTOMATA, LANGUAGES AND COMBINATORICS
"... It is proved that a homomorphism h preserves the class of languages recognized by trellis automata augmented with the capacity of handling the empty string (or, equivalently, generated by linear conjunctive grammars) if and only if either h is injective, or h maps every symbol to the empty string. ..."
Abstract
 Add to MetaCart
It is proved that a homomorphism h preserves the class of languages recognized by trellis automata augmented with the capacity of handling the empty string (or, equivalently, generated by linear conjunctive grammars) if and only if either h is injective, or h maps every symbol to the empty string. The
Efficient AutomatonBased Recognition for Linear Conjunctive Languages
"... Linear conjunctive grammars have recently been proved computationally equivalent to triangular trellis automata. The relation between these grammars and these automata resembles that between regular expressions and finite automata: while the former are better suited for human use, the latter are con ..."
Abstract

Cited by 3 (3 self)
 Add to MetaCart
Linear conjunctive grammars have recently been proved computationally equivalent to triangular trellis automata. The relation between these grammars and these automata resembles that between regular expressions and finite automata: while the former are better suited for human use, the latter
The Hardest Linear Conjunctive Language
 Information Processing Letters
"... This paper demonstrates that the Pcomplete language of yesinstances of Circuit Value Problem under a suitable encoding can be generated by a linear conjunctive grammar, or, equivalently, accepted by a triangular trellis automaton. This result has several implications on the properties of the langu ..."
Abstract

Cited by 6 (5 self)
 Add to MetaCart
This paper demonstrates that the Pcomplete language of yesinstances of Circuit Value Problem under a suitable encoding can be generated by a linear conjunctive grammar, or, equivalently, accepted by a triangular trellis automaton. This result has several implications on the properties
An Overview of Conjunctive Grammars
, 2003
"... Conjunctive grammars were introduced in 2000 as a generalization of contextfree grammars that allows the use of an explicit intersection operation in rules. Several theoretical results on their properties have been obtained since then, and a number of efficient parsing algorithms that justify th ..."
Abstract
 Add to MetaCart
Conjunctive grammars were introduced in 2000 as a generalization of contextfree grammars that allows the use of an explicit intersection operation in rules. Several theoretical results on their properties have been obtained since then, and a number of efficient parsing algorithms that justify
On the Number of Nonterminals in Linear Conjunctive
"... This paper studies the number of nonterminals in a linear conjunctive grammar as a descriptional complexity measure of this family of languages. It is proved that for every linear conjunctive grammar there exists and can be eectively constructed a linear conjunctive grammar that accepts the same ..."
Abstract
 Add to MetaCart
This paper studies the number of nonterminals in a linear conjunctive grammar as a descriptional complexity measure of this family of languages. It is proved that for every linear conjunctive grammar there exists and can be eectively constructed a linear conjunctive grammar that accepts the same
A Linear Conjunctive Grammar for the Circuit Value Problem
, 2002
"... In this paper we show that the Pcomplete language of yesinstances of Circuit Value Problem under a certain supplied encoding can be generated by a linear conjunctive grammar. Contents 1 ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
In this paper we show that the Pcomplete language of yesinstances of Circuit Value Problem under a certain supplied encoding can be generated by a linear conjunctive grammar. Contents 1
Representing a Pcomplete problem by small trellis automata
, 906
"... A restricted case of the Circuit Value Problem known as the Sequential NOR Circuit Value Problem was recently used to obtain very succinct examples of conjunctive grammars, Boolean grammars and language equations representing Pcomplete languages (Okhotin, “A simple Pcomplete problem and its repres ..."
Abstract
 Add to MetaCart
A restricted case of the Circuit Value Problem known as the Sequential NOR Circuit Value Problem was recently used to obtain very succinct examples of conjunctive grammars, Boolean grammars and language equations representing Pcomplete languages (Okhotin, “A simple Pcomplete problem and its
A TreeTrellis Nbest Decoder for Stochastic ContextFree Grammars
, 2000
"... In this paper a decoder for continuous speech recognition using stochastic contextfree grammars is described. It forms the backbone of the ACE recognizer, which is a modular system for realtime speech recognition. A new rationale for automata is introduced, as well as a new model for pruning the s ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
In this paper a decoder for continuous speech recognition using stochastic contextfree grammars is described. It forms the backbone of the ACE recognizer, which is a modular system for realtime speech recognition. A new rationale for automata is introduced, as well as a new model for pruning
Results 1  10
of
464