Search results for "languages"

showing 10 items of 2101 documents

Inglés contra valenciano. La introducción del multilingüismo en el sistema lingüístico educativo valenciano

2017

Aquest treball tracta sobre l’ús polític de les llengües i, singularment, centra l’atenció en el programa de plurilingüisme educatiu posat en marxa pel govern de la Generalitat Valenciana el 2012. Considerem que aquesta iniciativa obeïa una voluntat conscient del partit en el govern (PP) de minoritzar més encara el valencià davant el castellà, amb l’excusa de millorar el coneixement d’anglés. Ara bé, la iniciativa valenciana no és un fet aïllat, s’emmarca dins d’una proposta política d’àmbit estatal orientada a garantir la preeminència del castellà i debilitar le polítiques lingüístiques educatives favorables a les altres llengües espanyoles. Val a dir que fem el treball des de l'òptica com…

Política lingüística Comunidad Valenciana educación plurilingüismo diversidad lingüística multilingüismo.lcsh:Language and LiteratureEducació Aspectes políticslcsh:PC1-5498lcsh:Romanic languageslcsh:PValenciàLinguistic policy País Valencià education plurilingualism linguistic diversity multilingualism.Política lingüística País Valencià educació plurilingüisme diversitat lingüística multilingüisme.Revista de Llengua i Dret - Journal of Language and Law
researchProduct

On the Size Complexity of Deterministic Frequency Automata

2013

Austinat, Diekert, Hertrampf, and Petersen [2] proved that every language L that is (m,n)-recognizable by a deterministic frequency automaton such that m > n/2 can be recognized by a deterministic finite automaton as well. First, the size of deterministic frequency automata and of deterministic finite automata recognizing the same language is compared. Then approximations of a language are considered, where a language L′ is called an approximation of a language L if L′ differs from L in only a finite number of strings. We prove that if a deterministic frequency automaton has k states and (m,n)-recognizes a language L, where m > n/2, then there is a language L′ approximating L such that L′ c…

Powerset constructionPushdown automatonComputer Science::Computation and Language (Computational Linguistics and Natural Language and Speech Processing)Nonlinear Sciences::Cellular Automata and Lattice GasesCombinatoricsDeterministic pushdown automatonDeterministic finite automatonDeterministic automatonComputer Science::Programming LanguagesQuantum finite automataTwo-way deterministic finite automatonNondeterministic finite automatonComputer Science::Formal Languages and Automata TheoryMathematics
researchProduct

Monadic second-order logic over pictures and recognizability by tiling systems

1994

We show that a set of pictures (rectangular arrays of symbols) is recognized by a finite tiling system if and only if it is definable in existential monadic second-order logic. As a consequence, finite tiling systems constitute a notion of recognizability over two-dimensional inputs which at the same time generalizes finite-state recognizability over strings and matches a natural logic. The proof is based on the Ehrenfeucht-FraIsse technique for first-order logic and an implementation of “threshold counting” within tiling systems.

Predicate logicDiscrete mathematicsTheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGESComputer Science::Logic in Computer ScienceSubstructural logicSecond-order logicMultimodal logicDynamic logic (modal logic)Intermediate logicHigher-order logicComputer Science::Formal Languages and Automata TheoryMonadic predicate calculusMathematics
researchProduct

Monadic Second-Order Logic over Rectangular Pictures and Recognizability by Tiling Systems

1996

Abstract It is shown that a set of pictures (rectangular arrays of symbols) is recognized by a finite tiling system iff it is definable in existential monadic second-order logic. As a consequence, finite tiling systems constitute a notion of recognizability over two-dimensional inputs which at the same time generalizes finite-state recognizability over strings and also matches a natural logic. The proof is based on the Ehrenfeucht–Fraisse technique for first-order logic and an implementation of “threshold counting” within tiling systems.

Predicate logicMonadic second-order logicDiscrete mathematicsNatural logicIntermediate logicHigher-order logicMonadic predicate calculusComputer Science ApplicationsTheoretical Computer ScienceMathematics::LogicTheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGESComputational Theory and MathematicsComputer Science::Logic in Computer ScienceMany-valued logicDynamic logic (modal logic)Computer Science::Formal Languages and Automata TheoryInformation SystemsMathematicsInformation and Computation
researchProduct

Recent results on syntactic groups of prefix codes

2012

International audience; We give a simplified presentation of groups in transformation monoids. We use this presentation to describe two recent results on syntactic groups of prefix codes. The first one uses Sturmian words to build finite bifix codes with a given permutation group as syntactic group. The second one describes a class of prefix codes such that all their syntactic groups are cyclic.

Prefix codeDiscrete mathematicsClass (set theory)Group (mathematics)010102 general mathematicsComputer Science::Computation and Language (Computational Linguistics and Natural Language and Speech Processing)0102 computer and information sciencesPermutation group16. Peace & justice01 natural sciencesTransformation (music)Theoretical Computer SciencePrefixTheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGESComputational Theory and Mathematics[INFO.INFO-FL]Computer Science [cs]/Formal Languages and Automata Theory [cs.FL]010201 computation theory & mathematicsDiscrete Mathematics and CombinatoricsGeometry and Topology0101 mathematicsArithmeticComputer Science::Formal Languages and Automata Theory[INFO.INFO-FL] Computer Science [cs]/Formal Languages and Automata Theory [cs.FL]MathematicsEuropean Journal of Combinatorics
researchProduct

A Generalization of Girod's Bidirectional Decoding Method to Codes with a Finite Deciphering Delay

2012

Girod’s encoding method has been introduced in order to efficiently decode from both directions messages encoded by using finite prefix codes. In the present paper, we generalize this method to finite codes with a finite deciphering delay. In particular, we show that our decoding algorithm can be realized by a deterministic finite transducer. We also investigate some properties of the underlying unlabeled graph.

Prefix codeStrongly connected componentTheoretical computer scienceGeneralizationdeciphering delayData_CODINGANDINFORMATIONTHEORY0102 computer and information sciences02 engineering and technology01 natural sciences[INFO.INFO-FL]Computer Science [cs]/Formal Languages and Automata Theory [cs.FL]Encoding (memory)0202 electrical engineering electronic engineering information engineeringCode (cryptography)Computer Science (miscellaneous)prefix (free) codeunlabeled graphMathematicsCode[MATH.MATH-IT]Mathematics [math]/Information Theory [math.IT]020206 networking & telecommunicationsCode; deciphering delay; prefix (free) code; strongly connected component; transducer; unlabeled graph; Computer Science (miscellaneous)Prefixtransducer[INFO.INFO-IT]Computer Science [cs]/Information Theory [cs.IT]010201 computation theory & mathematicsGraph (abstract data type)strongly connected componentAlgorithmDecoding methods
researchProduct

Some Decision Results on Nonrepetitive Words

1985

The paper addresses some generalizations of the Thue Problem such as: given a word u, does there exist an infinite nonrepetitive overlap free (or square free) word having u as a prefix? A solution to this as well as to related problems is given for the case of overlap free words on a binary alphabet.

PrefixCombinatoricsTheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGESComputer Science::Discrete MathematicsUnique factorization domainComputer Science::Computation and Language (Computational Linguistics and Natural Language and Speech Processing)Square-free integerComputer Science::Formal Languages and Automata TheoryBinary alphabetWord (computer architecture)Mathematics
researchProduct

Translingual Practices in Global Business : A Longitudinal Study of a Professional Communicative Repertoire

2018

This chapter draws on a longitudinal ethnographic study of a Finnish engineer’s communicative repertoire that develops in the process of professional migration. The participant first works as a factory intern in Germany, then as a project engineer and project manager in Finland, and latterly as an operations manager in China. Here, repertoire is viewed through dynamic and flexible translingual practices, in which people follow, appropriate and invent norms, combine and shuttle between languages, ways of speaking, semiotic resources and modalities in the transnational work space in order to meet, interact, make meaning and build relationships and, ultimately, do their jobs. The data selected…

Process (engineering)global businesslingua francatProject managerPedagogyEthnographySemioticsSociologykansainvälinen kauppa060201 languages & linguisticskääntäminenModalitiesetnografiaComputingMilieux_THECOMPUTINGPROFESSIONRepertoire05 social sciencesrepertoireEnglish as a business lingua Franca050301 education06 humanities and the artsmeetingtranslingual practiceskielenkäyttö0602 languages and literatureFactory (object-oriented programming)kääntäjät0503 educationMeaning (linguistics)
researchProduct

Profesore Marta Rudzīte: bibliogrāfiskais rādītājs

2004

LU Filoloģijas fakultātes Baltu valodu katedras profesores habilitētās filoloģijas doktores Martas Rudzītes bibliogrāfiskajā rādītājā apkopotas valodnieces zinātniskās, populārzinātniskās, mācību un citas publikācijas no 1954. līdz 2004. gadam, literatūra par viņu. Izdevums atspoguļo prof. M. Rudzītes veikumu zinātnē un kultūrā.

Professors of the Latvian UniversityLatviešu valoda - bibliogrāfiskais rādītājsBibliogrāfiskie rādītājiBaltu valodniecība - bibliogrāfiskais rādītājsHistorische Grammatik der lettischen Sprache - bibliographischer IndexFiloloģijas zinātņu profesori Latvijas UniversitātēLatviešu valodas izloksnes - bibliogrāfiskais rādītājsLatviešu valodas dialektoloģija - bibliogrāfiskais rādītājsLettische Dialekte - bibliographischer IndexHistory of the University of LatviaBaltische Sprachen - bibliographischer IndexBaltu valodas - bibliogrāfiskais rādītājsLatviešu valodniecība - bibliogrāfiskais rādītājsLatvijas Universitātes vēstureLatviešu valodas vēsturiskā gramatika - bibliogrāfiskais rādītājsLettische Sprache - bibliographischer Index:HUMANITIES and RELIGION::Languages and linguistics::Other languages::Baltic languages [Research Subject Categories]Latvijas Universitātes profesori
researchProduct

Biznesa procesu modelēšana, izmantojot metamodelēšanas paņēmienus : kopsavilkums

2007

Darba tēma ir saistīta ar biznesa procesu vadības sistēmu izstrādi. Šajā darbā biznesa procesu modelēšanas problēmas ir risinātas, izmantojot metamodelēšanas paņēmienus. Metamodelēšana ļauj dažādus biznesa modelēšanas aspektus aplūkot vienotā un vispārīgā formā, tai pat laikā nezaudējot precīzu jēdzienu nozīmi. Galvenie pētījumu rezultāti ir sekojoši: Izstrādāts vienots biznesa procesu un to apkārtnes metamodelis, kas parāda biznesa modelēšanas jēdzienus un to saistību. Izstrādāta biznesa modeļu jēdzienu kartēšanas metode jēdzienu kartēšanai no viena domēna uz vairākām modelēšanas valodām. Izstrādāta precīza Unified Modeling Language Aktivitāšu diagrammas (UML AD) izpildes semantika, izmant…

Programming languages ​​and systemsDatorzinātnesProgrammēšanas valodas un sistēmas
researchProduct