Search results for "Grammar"

showing 10 items of 662 documents

Splicing Systems from Past to Future: Old and New Challenges

2014

A splicing system is a formal model of a recombinant behaviour of sets of double stranded DNA molecules when acted on by restriction enzymes and ligase. In this survey we will concentrate on a specific behaviour of a type of splicing systems, introduced by P\u{a}un and subsequently developed by many researchers in both linear and circular case of splicing definition. In particular, we will present recent results on this topic and how they stimulate new challenging investigations.

FOS: Computer and information sciencesDiscrete Mathematics (cs.DM)[INFO.INFO-FL]Computer Science [cs]/Formal Languages and Automata Theory [cs.FL]Formal Languages and Automata Theory (cs.FL)Splicing Systems Formal Languages.ACM: F.: Theory of Computation/F.4: MATHEMATICAL LOGIC AND FORMAL LANGUAGES/F.4.3: Formal LanguagesACM: F.: Theory of Computation/F.4: MATHEMATICAL LOGIC AND FORMAL LANGUAGES/F.4.2: Grammars and Other Rewriting SystemsComputer Science - Formal Languages and Automata TheorySplicing Systems Formal languages Regular languages DNA computingComputingMilieux_MISCELLANEOUS[INFO.INFO-FL] Computer Science [cs]/Formal Languages and Automata Theory [cs.FL]Computer Science - Discrete Mathematics
researchProduct

On prefix normal words and prefix normal forms

2016

A $1$-prefix normal word is a binary word with the property that no factor has more $1$s than the prefix of the same length; a $0$-prefix normal word is defined analogously. These words arise in the context of indexed binary jumbled pattern matching, where the aim is to decide whether a word has a factor with a given number of $1$s and $0$s (a given Parikh vector). Each binary word has an associated set of Parikh vectors of the factors of the word. Using prefix normal words, we provide a characterization of the equivalence class of binary words having the same set of Parikh vectors of their factors. We prove that the language of prefix normal words is not context-free and is strictly contai…

FOS: Computer and information sciencesPrefix codePrefix normal wordPre-necklaceDiscrete Mathematics (cs.DM)General Computer ScienceFormal Languages and Automata Theory (cs.FL)Binary numberComputer Science - Formal Languages and Automata TheoryContext (language use)Binary languageLyndon words0102 computer and information sciences02 engineering and technologyPrefix grammarprefix normal formsKraft's inequalityCharacterization (mathematics)Lyndon word01 natural sciencesPrefix normal formenumerationTheoretical Computer ScienceFOS: Mathematics0202 electrical engineering electronic engineering information engineeringMathematics - CombinatoricsMathematicsDiscrete mathematicsprefix normal words prefix normal forms binary languages binary jumbled pattern matching pre-necklaces Lyndon words enumerationbinary jumbled pattern matchingSettore INF/01 - InformaticaComputer Science (all)pre-necklacesComputer Science::Computation and Language (Computational Linguistics and Natural Language and Speech Processing)prefix normal wordsPrefix010201 computation theory & mathematics020201 artificial intelligence & image processingCombinatorics (math.CO)binary languagesComputer Science::Formal Languages and Automata TheoryWord (group theory)Computer Science - Discrete MathematicsTheoretical Computer Science
researchProduct

Combining Markov Random Fields and Convolutional Neural Networks for Image Synthesis

2016

This paper studies a combination of generative Markov random field (MRF) models and discriminatively trained deep convolutional neural networks (dCNNs) for synthesizing 2D images. The generative MRF acts on higher-levels of a dCNN feature pyramid, controling the image layout at an abstract level. We apply the method to both photographic and non-photo-realistic (artwork) synthesis tasks. The MRF regularizer prevents over-excitation artifacts and reduces implausible feature mixtures common to previous dCNN inversion approaches, permitting synthezing photographic content with increased visual plausibility. Unlike standard MRF-based texture synthesis, the combined system can both match and adap…

FOS: Computer and information sciencesRandom fieldMarkov random fieldArtificial neural networkMarkov chainComputer sciencebusiness.industryComputer Vision and Pattern Recognition (cs.CV)Computer Science - Computer Vision and Pattern RecognitionComputingMethodologies_IMAGEPROCESSINGANDCOMPUTERVISION020207 software engineeringPattern recognition02 engineering and technologyIterative reconstructionConvolutional neural networkComputingMethodologies_PATTERNRECOGNITION0202 electrical engineering electronic engineering information engineering020201 artificial intelligence & image processingComputer visionArtificial intelligencebusinessGenerative grammarTexture synthesis2016 IEEE Conference on Computer Vision and Pattern Recognition (CVPR)
researchProduct

Generalized Logical Operations among Conditional Events

2018

We generalize, by a progressive procedure, the notions of conjunction and disjunction of two conditional events to the case of n conditional events. In our coherence-based approach, conjunctions and disjunctions are suitable conditional random quantities. We define the notion of negation, by verifying De Morgan’s Laws. We also show that conjunction and disjunction satisfy the associative and commutative properties, and a monotonicity property. Then, we give some results on coherence of prevision assessments for some families of compounded conditionals; in particular we examine the Frechet-Hoeffding bounds. Moreover, we study the reverse probabilistic inference from the conjunction $\mathcal…

FOS: Computer and information sciencesSettore MAT/06 - Probabilita' E Statistica MatematicaComputer Science - Artificial IntelligenceComputer scienceMonotonic functionProbabilistic reasoning02 engineering and technologyCommutative Algebra (math.AC)Conditional random quantitieFréchet-Hoeffding boundCoherent extensionNegationArtificial IntelligenceQuasi conjunction0202 electrical engineering electronic engineering information engineeringFOS: MathematicsCoherent prevision assessmentConditional eventNon-monotonic logicRule of inferenceCommutative propertyAssociative propertyDiscrete mathematicsProbability (math.PR)Probabilistic logicOrder (ring theory)ConjunctionMathematics - LogicCoherence (philosophical gambling strategy)p-entailmentProbabilistic inferenceMathematics - Commutative AlgebraConjunction (grammar)Artificial Intelligence (cs.AI)020201 artificial intelligence & image processingInference ruleNegationLogic (math.LO)Mathematics - ProbabilityDisjunction
researchProduct

Complexity of probabilistic versus deterministic automata

2005

Finite-state machineNested wordTheoretical computer scienceDFA minimizationDeterministic automatonComputer scienceDeterministic context-free grammarAutomata theoryQuantum finite automataProbabilistic analysis of algorithms
researchProduct

Morphology in phonology. Introduction

2005

This fourth volume of Catalan Journal of Linguistics is devoted to a topic discussed at length in the literature but which nevertheless remains a challenge for any view of phonology: the morphology-phonology interaction. The papers collected address two related issues, the role of morphological information in phonology and the role of phonological information in morphology. The first six articles (i.e. McCarthy, Wheeler, Downing, van Oostendorp, José and Auger, and Rice) deal with the former topic; the last three (i.e. Bertinetto and Jetchev, Pérez Saldanya and Vallès, and Viaplana), with the latter. Several papers (Wheeler, van Oostendorp, Rice, Bertinetto and Jetchev, Pérez Saldanya and V…

FonologiaLinguistics and LanguageLingüísticaNeogrammarianPhilosophyP1-1091LinguisticsMorphology (biology)PhonologyPhonologyLanguage and Linguisticslanguage.human_languageLinguisticsCatalà parlatMorphology (Grammar)Morfologia (Gramàtica)languageCatalanPhilology. LinguisticsCatalan Journal of Linguistics
researchProduct

El tractament de les formes nominals 'invariables' quant a nombre

1995

The starting claim of this paper is that it is not accidental that in Catalan, as in Spanish, invariable nominals regarding number end in the same form as the regular plural marker, i.e., s, and thus any analysis willing to explain these words has to take this fact into account. Under this assumption, different proposals are evaluated: the existence of a `zero'-plural morph, the blocking of s (plural marker)-insertion, the deletion of s-plural marker, the ambimorphic interpretation of -s+s, the unspecified blocking of one of the two ss, and the deletion of the s-stem. The latter analysis is favoured, except for compounds whose second element is already plural, in which case the ambimorphic …

Fonologiaformes nominals invariableslcsh:Language and LiteratureUNESCO::CIENCIAS DE LAS ARTES Y LAS LETRASLingüísticaFilologíasPhonologyfonologia; formes nominals invariablesNombre (Gramàtica)lcsh:Philology. Linguisticslcsh:P1-1091:CIENCIAS DE LAS ARTES Y LAS LETRAS [UNESCO]lcsh:PNumber (Grammar)fonologiaCaplletra. Revista Internacional de Filologia
researchProduct

Correlates and Predictors of L2 Willingness to Communicate in Polish Adolescents

2014

The concept of willingness to communicate (WTC) in L2 denotes “a readiness to enter into discourse at a particular time with a specific person or persons, using a L2” (MacIntyre et al. 1998, p. 547). In the early model of L2 WTC, there are two main variables influencing its levels: perceived communication competence and communication anxiety (MacIntyre 1994). WTC is now considered a fundamental goal of second language education (MacIntyre et al. 2003) because it offers L2 learners “greater chances for L2 practice and authentic L2 usage” (MacIntyre et al. 2001, p. 382). Students taking the risk of initiating communication in a language they do not know well are likely to become more proficie…

Foreign languagemedicineAnxietyResidenceGrammar schoolmedicine.symptomWillingness to communicateLanguage acquisitionTeacher supportPsychologySocial psychologyCompetence (human resources)
researchProduct

Social Movements, Voluntary Associations and Cycles of Protest in Finland 1905-91

1992

During the 20th century five cycles of protest have emerged in Finland: 1905-18, 1928-32, 1944-48, 1966-76, and the continuing cycle of new social movements beginning around the end of the 1970s. This article begins with an examination of the differences and similarities in the formation of these cycles against the background of antecedent political opportunity structures. The question of the relationship between social protest movements and formal voluntary associations is then addressed. It is shown that social movements and formal voluntary associations have been interactive, mutually reinforcing ways of reacting to different manifestations of social crisis. Existing formal associations …

Formal associationsPolitical opportunitySociology and Political Sciencemedia_common.quotation_subjectVoluntary associationWelfare stateAntecedent (grammar)State (polity)Political economyPolitical scienceDevelopment economicsNew social movementsSocial movementmedia_commonScandinavian Political Studies
researchProduct

Cancellation, pumping and permutation in formal languages

1984

Formal grammarTheoretical computer scienceChomsky hierarchyFormal languageContext-free languageAbstract family of languagesPumping lemma for context-free languagesArithmeticCone (formal languages)Pumping lemma for regular languagesMathematics
researchProduct