A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is `application/pdf`

.

## Filters

##
###
Conjunctive Categorial Grammars

2017
*
Proceedings of the 15th Meeting on the Mathematics of Language
*

*grammars*enhanced with

*conjunction*. ... Basic categorial

*grammars*are enriched with a

*conjunction*operation, and it is proved that the formalism obtained in this way has the same expressive power as

*conjunctive*

*grammars*, that is, context-free ...

*conjunctive*

*grammars*. ...

##
###
Conjunction in meta-restriction grammar

1986
*
The Journal of Logic Programming
*

" rules of the

doi:10.1016/0743-1066(86)90009-9
fatcat:jjbajz3gjvhrtck45bd5k3oake
*grammar*into more complex rules for handling*conjunction*. ... The work of Sedogbo requires the*grammar*writer to modify each relevant*grammar*rule in two ways: first, a predicate CONJ is added to generate a*conjunction*option for each rule where*conjunction*can occur ... COVERAGE OF SENTENCES WITH*CONJUNCTION*Parse times are for the translated, compiled*grammar*in Quintus PROLOG on a VAX 11/785 running first (second) parse and to termination. ...##
###
Conjunctive grammars with restricted disjunction

2010
*
Theoretical Computer Science
*

The first author also wishes to thank Christos Nomikos and Panos Rondogiannis for discussions about the Greibach normal form for

doi:10.1016/j.tcs.2010.03.015
fatcat:k3wwhmpevveapjoe2uigrqxp2u
*conjunctive**grammars*. ...*conjunctive**grammar*generating this language. ... Restricted*conjunctive**grammars*without ε-rules The above simulation of an arbitrary*conjunctive**grammar*by a*conjunctive**grammar*with restricted disjunction essentially uses rules of the form A → ε, known ...##
###
Conjunctive Grammars with Restricted Disjunction
[chapter]

2009
*
Lecture Notes in Computer Science
*

Two definitions of

doi:10.1007/978-3-540-95891-8_39
fatcat:jytaxidksnew3ofzuxamoxjlme
*conjunctive**grammars*Example Example*Conjunctive**grammar*for {a n b n c n | n 0}: S → AB&DC {a n b n c n | n 0} A → aA | ε a * B → bBc | ε {b k c k | k 0} C → cC | ε c * D → aDb | ... (K ∪ {ε})(L ∪ {ε}) ∩ Odd = (¨B ∅ KL ∪ K ∪ L ∪ & & & b ∅ {ε}) ∩ Odd = K ∪ L Expressible in*conjunctive**grammars*. ...##
###
AN OVERVIEW OF CONJUNCTIVE GRAMMARS
[chapter]

2004
*
Current Trends in Theoretical Computer Science
*

*Conjunctive*

*grammars*were introduced in 2000 as a generalization of context-free

*grammars*that allows the use of an explicit intersection operation in rules. ... Every linear context-free

*grammar*is both context-free and linear

*conjunctive*, while every context-free and every linear

*conjunctive*

*grammar*is

*conjunctive*. ... Linear

*conjunctive*

*grammars*Although linear

*conjunctive*

*grammars*were introduced in 2000 together with

*conjunctive*

*grammars*[12, 13] , the family they generate has been studied long before [6, 3] . ...

##
###
Conjunctive grammars and alternating pushdown automata

2013
*
Acta Informatica
*

*Conjunctive*

*Grammars*(CG) are an example of such a model. Introduced by Okhotin in [1], CG are a generalization of context-free

*grammars*. ... In this paper we introduce a variant of alternating pushdown automata, Synchronized Alternating Pushdown Automata, which accept the same class of languages as those generated by

*conjunctive*

*grammars*. ... Linear

*Conjunctive*

*Grammars*Okhotin defines in [1] a sub-family of

*conjunctive*

*grammars*called Linear

*Conjunctive*

*Grammars*(LCG). ...

##
###
Conjunctive Grammars and Alternating Pushdown Automata
[chapter]

2008
*
Lecture Notes in Computer Science
*

*Conjunctive*

*Grammars*(CG) are an example of such a model. Introduced by Okhotin in [1], CG are a generalization of context-free

*grammars*. ... In this paper we introduce a variant of alternating pushdown automata, Synchronized Alternating Pushdown Automata, which accept the same class of languages as those generated by

*conjunctive*

*grammars*. ... Linear

*Conjunctive*

*Grammars*Okhotin defines in [1] a sub-family of

*conjunctive*

*grammars*called Linear

*Conjunctive*

*Grammars*(LCG). ...

##
###
The Hardest Language for Conjunctive Grammars
[chapter]

2016
*
Lecture Notes in Computer Science
*

This paper establishes similar characterizations for

doi:10.1007/978-3-319-34171-2_24
fatcat:6mcv4ybzgjdyleqnmn3l4gicjy
*conjunctive**grammars*, that is, for*grammars*extended with a*conjunction*operator. ... Boolean*grammars*further extend*conjunctive**grammars*with a negation operator. Definition 3. ... Hardest language for*conjunctive**grammars*The goal is to establish the following analogue of Greibach's hardest language theorem for*conjunctive**grammars*. Theorem 1. ...##
###
The Grammars of Conjunction Agreement in Slovenian

2015
*
Syntax
*

corpus study. 2 We show that existing analyses cannot explain the Slovenian facts, in particular the cases of preverbal, last-

doi:10.1111/synt.12025
fatcat:b2p5plv5bnf7hduyfu2eqfpdam
*conjunct*agreement. ... In this paper we present a discussion of Slovenian*conjunct*agreement phenomena, arguing that in one of the two strategies for determining agreement, agreement is simply linear; that is, verbal forms agree ... the*conjunction*deal with the constituent of the*conjunction*as a whole. ...##
###
CONJUNCTIVE GRAMMARS GENERATE NON-REGULAR UNARY LANGUAGES

2008
*
International Journal of Foundations of Computer Science
*

{a 4 n : n ∈ N}
Theorem (Extension)
Artur Jeż

doi:10.1142/s012905410800584x
fatcat:letnthmzqvbunalvxbv4ghaqmq
*Conjunctive**grammars*generate non-regular unary languages August 21, 2007 11 / 21 Result Theorem (Disproving the conjecture)*Conjunctive**grammars*...*grammars*generate non-regular unary languages August 21, 2007 9 / 21 Problem Problem Do all*conjunctive**grammars*over unary alphabet generate only regular languages? ...##
###
Unambiguous Conjunctive Grammars over a One-Letter Alphabet
[chapter]

2013
*
Lecture Notes in Computer Science
*

These constructions are used to show that for every fixed unambiguous

doi:10.1007/978-3-642-38771-5_25
fatcat:kjmtjzyb25ekdjcf27me7pvmgu
*conjunctive*language L0, testing whether a given unambiguous*conjunctive**grammar*generates L0 is undecidable. ... It is demonstrated that unambiguous*conjunctive**grammars*over a unary alphabet Σ = {a} have non-trivial expressive power, and that their basic properties are undecidable. ...*Conjunctive**grammars*and ambiguity*Conjunctive**grammars*generalize context-free*grammars*by allowing an explicit*conjunction*operation in the rules. ...##
###
Whale Calf, a Parser Generator for Conjunctive Grammars
[chapter]

2003
*
Lecture Notes in Computer Science
*

*Conjunctive*

*grammars*inherit all descriptive capabilities of context-free

*grammars*(since every context-free

*grammar*is a

*conjunctive*

*grammar*) and give an opportunity to use an explicit language intersection ... All existing parsing algorithms for

*conjunctive*

*grammars*are supported. ... free

*grammar*, i.e.

*conjunctive*

*grammars*correctly generalize the context-free

*grammars*. ...

##
###
One-Nonterminal Conjunctive Grammars over a Unary Alphabet
[chapter]

2009
*
Lecture Notes in Computer Science
*

This implies undecidability of some properties of one-nonterminal

doi:10.1007/978-3-642-03351-3_19
fatcat:ha323eea4rb2xm2ggirs5fvlvu
*conjunctive**grammars*over a unary alphabet. ... One-nonterminal*conjunctive**grammars*The goal is to simulate an arbitrary*conjunctive**grammar*over {a} by a*conjunctive**grammar*with a single nonterminal symbol. ...*Conjunctive**grammars*and systems of equations*Conjunctive**grammars*generalize context-free*grammars*by allowing an explicit*conjunction*operations in the rules. Definition 1 (Okhotin [9] ). ...##
###
Learning Grammar with Explicit Annotations for Subordinating Conjunctions

2014
*
Proceedings of the ACL 2014 Student Research Workshop
*

This paper proposes a method to develop a

doi:10.3115/v1/p14-3007
dblp:conf/acl/LiZW14
fatcat:rvdmacdg3nep3dlvjaqlfqvlum
*grammar*with hierarchical category knowledge of subordinating*conjunctions*as explicit annotations. ... Subordinating*conjunctions*impose important constraints on Chinese syntactic structures. ...*grammar*. ...##
###
Conjunctive and Boolean grammars: The true general case of the context-free grammars

2013
*
Computer Science Review
*

*Conjunctive*

*grammars*extend the definition of a context-free

*grammar*by allowing a

*conjunction*operation in the rules; Boolean

*grammars*are further equipped with an explicit negation. ... This paper surveys the results on

*conjunctive*and Boolean

*grammars*obtained over the last decade, comparing them to the corresponding results for ordinary context-free

*grammars*and their main subfamilies ...

*grammars*or for unambiguous

*conjunctive*

*grammars*. ...

« Previous

*Showing results 1 — 15 out of 74,964 results*