Search results for " Languages"

showing 10 items of 1859 documents

Word assembly through minimal forbidden words

2006

AbstractWe give a linear-time algorithm to reconstruct a finite word w over a finite alphabet A of constant size starting from a finite set of factors of w verifying a suitable hypothesis. We use combinatorics techniques based on the minimal forbidden words, which have been introduced in previous papers. This improves a previous algorithm which worked under the assumption of stronger hypothesis.

General Computer ScienceFragment assemblyFactor automaton[INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS][INFO.INFO-DS] Computer Science [cs]/Data Structures and Algorithms [cs.DS]0102 computer and information sciences02 engineering and technology01 natural sciencesMinimal forbidden wordTheoretical Computer ScienceCombinatorics0202 electrical engineering electronic engineering information engineeringFinite setComputingMilieux_MISCELLANEOUSCombinatorics on wordMathematicsShortest superstringCombinatorics on wordsRepetition index16. Peace & justice010201 computation theory & mathematics020201 artificial intelligence & image processingAlphabetConstant (mathematics)Word (computer architecture)Computer Science::Formal Languages and Automata TheoryComputer Science(all)
researchProduct

Transmediating argumentation : Students composing across written essays and digital videos in higher education

2016

This comparative study examined how university students built an argument in written essays and multimodal digital videos, and how their argumentation transmediated across these two mediums. Data analysis involved 1) analysis of content in both written essays and digital videos; 2) the development of transmediation visualizations to elucidate how ideas were transformed from essays into videos; and 3) multimodal analysis to understand the communicative affordances and constrains for argumentation with each medium. The findings revealed that the most common type of content in both essays and videos was supportive argumentation; however, the videos did not include any counter-argumentation. St…

General Computer ScienceHigher educationComputer sciencetransmediationEducationArgumentation theoryMultimodalityargumentationArgumentMultimodal analysisPedagogyMathematics educationta516Affordancemultimodalitymultimodaalisuus060201 languages & linguisticsbusiness.industry05 social sciences050301 educationFlexibility (personality)06 humanities and the artsVariety (cybernetics)digital literacieshigher education0602 languages and literatureargumentointibusiness0503 education
researchProduct

Mathematical logic and quantum finite state automata

2009

AbstractThis paper is a review of the connection between formulas of logic and quantum finite-state automata in respect to the language recognition and acceptance probability of quantum finite-state automata. As is well known, logic has had a great impact on classical computation, it is promising to study the relation between quantum finite-state automata and mathematical logic. After a brief introduction to the connection between classical computation and logic, the required background of the logic and quantum finite-state automata is provided and the results of the connection between quantum finite-state automata and logic are presented.

General Computer ScienceMeasure-many quantum finite-state automataComputational logicMultimodal logicQuantum dot cellular automatonIntermediate logicMeasure-once quantum finite-state automataNonlinear Sciences::Cellular Automata and Lattice GasesTheoretical Computer ScienceAlgebraTheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGESModular logicComputerSystemsOrganization_MISCELLANEOUSComputer Science::Logic in Computer ScienceQuantum finite automataDynamic logic (modal logic)Automata theoryQuantum finite-state automataFirst-order logicAlgorithmComputer Science::Formal Languages and Automata TheoryMathematicsQuantum cellular automatonComputer Science(all)Theoretical Computer Science
researchProduct

From Nerode's congruence to Suffix Automata with mismatches

2009

AbstractIn this paper we focus on the minimal deterministic finite automaton Sk that recognizes the set of suffixes of a word w up to k errors. As first result we give a characterization of the Nerode’s right-invariant congruence that is associated with Sk. This result generalizes the classical characterization described in [A. Blumer, J. Blumer, D. Haussler, A. Ehrenfeucht, M. Chen, J. Seiferas, The smallest automaton recognizing the subwords of a text, Theoretical Computer Science, 40, 1985, 31–55]. As second result we present an algorithm that makes use of Sk to accept in an efficient way the language of all suffixes of w up to k errors in every window of size r of a text, where r is the…

General Computer ScienceOpen problem[INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS]0102 computer and information sciences02 engineering and technologyString searching algorithm01 natural sciencesTheoretical Computer ScienceCombinatoricsDeterministic automatonSuffix automata0202 electrical engineering electronic engineering information engineeringCombinatorics on words Indexing Suffix Automata Languages with mismatches Approximate string matchingMathematicsDiscrete mathematicsCombinatorics on wordsApproximate string matchingSettore INF/01 - InformaticaLanguages with mismatchesComputer Science::Computation and Language (Computational Linguistics and Natural Language and Speech Processing)PrefixCombinatorics on wordsDeterministic finite automaton010201 computation theory & mathematicsSuffix automatonIndexing020201 artificial intelligence & image processingSuffixComputer Science::Formal Languages and Automata TheoryComputer Science(all)
researchProduct

The Cone Structure Theorem

2020

Made available in DSpace on 2022-05-01T11:54:27Z (GMT). No. of bitstreams: 0 Previous issue date: 2021-07-01 We consider the topological classification of finitely determined map germs f: (Rn, 0) → (Rp, 0) with f-1(0) = {0}. Associated with f we have a link diagram, which is well defined up to topological equivalence. We prove that f is topologically A-equivalent to the generalized cone of its link diagram. Centro de Ciências e Tecnologia Universidade Federal Do Cariri, 63048-080, Juazeiro do Norte Universidade Estadual Paulista (Unesp) Instituto de Biociências Letras e Ciências Exatas Campus de São José Do Rio Preto, 15054-000, São José do Rio Preto Departament de Matemàtiques Universitat …

General Mathematics010102 general mathematics0502 economics and business05 social sciencesMathematical analysis050207 economics0101 mathematics01 natural sciencesCone (formal languages)MathematicsStructured program theoremInternational Mathematics Research Notices
researchProduct

The Existence of Solutions for Local Dirichlet (r(u),s(u))-Problems

2022

In this paper, we consider local Dirichlet problems driven by the (r(u),s(u))-Laplacian operator in the principal part. We prove the existence of nontrivial weak solutions in the case where the variable exponents r,s are real continuous functions and we have dependence on the solution u. The main contributions of this article are obtained in respect of: (i) Carathéodory nonlinearity satisfying standard regularity and polynomial growth assumptions, where in this case, we use geometrical and compactness conditions to establish the existence of the solution to a regularized problem via variational methods and the critical point theory; and (ii) Sobolev nonlinearity, somehow related to the spac…

General Mathematicsregularized problem(<i>r</i>(<i>u</i>)<i>s</i>(u))-Laplacian operatorPalais-Smale conditionweak solutionComputer Science::Digital Libraries(<i>r</i>(<i>u</i>)<i>s</i>(u))-Laplacian operator; Palais-Smale condition; monotone operator; regularized problem; weak solutionSettore MAT/05 - Analisi Matematicamonotone operatorComputer Science (miscellaneous)QA1-939Computer Science::Programming Languages(r(u) s(u))-Laplacian operatorEngineering (miscellaneous)MathematicsMathematics
researchProduct

Connecting Granular and Topological Relations through Description Logics

2021

Granularity deals with organizing in greater or lesser detail data, information, and knowledge that resides at a granular level. This organization is carried out according to certain criteria, which thereby provide a context view or dimension also called granular perspective. Topological relations express spatial associations among geospatial features (points, polylines, and polygons); they represent a horizontal spatial analysis. The two domains allow scientists to conceive different perspectives of the world. In this article, we aim to combine the two representations through Description Logics (DL) rules to relate granular (vertical representation) and geospatial topological (horizontal r…

GeoSPARQL[INFO.INFO-LO] Computer Science [cs]/Logic in Computer Science [cs.LO]Topological RelationsGranular RelationsGranular ComputingDescription LogicGeospatial Data[INFO.INFO-FL] Computer Science [cs]/Formal Languages and Automata Theory [cs.FL][MATH.MATH-GN] Mathematics [math]/General Topology [math.GN]
researchProduct

Motzkin subposets and Motzkin geodesics in Tamari lattices

2014

The Tamari lattice of order n can be defined by the set D n of Dyck words endowed with the partial order relation induced by the well-known rotation transformation. In this paper, we study this rotation on the restricted set of Motzkin words. An upper semimodular join semilattice is obtained and a shortest path metric can be defined. We compute the corresponding distance between two Motzkin words in this structure. This distance can also be interpreted as the length of a geodesic between these Motzkin words in a Tamari lattice. So, a new upper bound is obtained for the classical rotation distance between two Motzkin words in a Tamari lattice. For some specific pairs of Motzkin words, this b…

GeodesicSemilattice0102 computer and information sciences[INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM][ MATH.MATH-CO ] Mathematics [math]/Combinatorics [math.CO]01 natural sciencesUpper and lower boundsTheoretical Computer ScienceCombinatorics[MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO]0101 mathematicsComputingMilieux_MISCELLANEOUSMathematicsDiscrete mathematicsMathematics::Combinatorics010102 general mathematics[ INFO.INFO-DM ] Computer Science [cs]/Discrete Mathematics [cs.DM]Join (topology)Computer Science ApplicationsJoin and meet010201 computation theory & mathematicsSignal ProcessingMotzkin numberTamari latticeRotation (mathematics)Computer Science::Formal Languages and Automata TheoryInformation Systems
researchProduct

Representaciones escolares del Clima en el Paisaje fluvial del río Clariano

2020

Resumen:El conocimiento de la relación entre el clima y el paisaje convive con las dificultades propias del ámbito escolar. Para saber qué ocurre en su enseñanza, se analiza por medio del instrumento Evocation 2005 y los registros pictóricos, las representaciones sociales que tiene una parte del alumnado de 1º ESO. El estudio de caso sobre un paisaje fluvial en un ámbito local confirma la idealización del paisaje y la escasa presencia del clima en las representaciones del alumnado, esto junto con las dificultades de los docentes en su conocimiento disciplinar y su práctica nos conmina a quebrar las tradiciones y rutinas escolares para afrontar mejor las explicaciones de las transformaciones…

Geography (General)050101 languages & linguisticsLC8-669105 social sciences050301 educationSpecial aspects of educationPaisatgerepresentaciones socialesEvocationpaisajeclimaG1-9220501 psychology and cognitive sciencesSchool environmentSociologyVegetació i clima0503 educationHumanitiesdidácticaEnsenyament
researchProduct

Language in Central Europe: An Overview

2009

The linguistic picture of Central Europe, as we know it, started forming in the 6th to 9th centuries. The coming of the Slavs (or rather the spread of their language and way of life to unrelated various ethnic groups) marks the beginning of this caesura that largely closed in 896 AD when the Magyars crossed the Carpathians into Pannonia. This event gradually divided the hypothetically continuous area of Slavic settlement into a southern section, extending from contemporary Slovenia to Bulgaria, and into a northern section, which coincided with the areas from the Elbe in today’s eastern Germany to the upper Volga in north­eastern Russia. In the west, the Magyar-speakers skirted the East and …

Geographygeography.geographical_feature_categorySteppelanguageLatin alphabetOfficial languageCumansSlavic languagesPolishAncient historyBulgarslanguage.human_languageRoman Empire
researchProduct