Search results for "programming languages"

showing 10 items of 138 documents

Determination of Zircaloy -4 Radiocristallographic Elastic Constants from Room Temperature to 300°C

2000

A new experimental apparatus, allowing the determination of radiocristallographic elastic constants (REC) as a function of the temperature is presented. The material studied the zirconium alloy Zircaloy-4, showing low elastic anisotropy, an isotropic treatment of the problem is possible. As a consequence, the classical sin 2 ψ method is used to determine the REC from room temperature to 300°C.

CrystallographyMaterials scienceMechanics of MaterialsMechanical EngineeringZirconium alloyIsotropyElastic anisotropyComputer Science::Programming LanguagesGeneral Materials ScienceFunction (mathematics)Composite materialCondensed Matter PhysicsMaterials Science Forum

researchProduct

Metamodel-based transformation-driven graphical tool building platform

2009

Pēdējo gadu laikā programmatūras izstrādē arvien lielāku popularitāti gūst modeļu balstītā pieeja (MDSD – Model Driven Software Development). MDSD tehnoloģijas pamatideja ir balstīt visu programmatūras izstrādes procesu uz katrai izstrādes fāzei atbilstošiem specializētiem modeļiem. Šie modeļi ne tikai dokumentē dažādus sistēmas aspektus, bet arī kļūst par tiešu programmatūras sastāvdaļu. Mūsdienu praksē MDSD modeļu aprakstam bieži izmanto specializētas modelēšanas valodas, sauktas par domēna (priekšmeta apgabala jeb lietojumsfēras) specifiskajām valodām (DSL – Domain Specific Language). Šīs valodas ļauj uzskatāmāk un efektīvāk aprakstīt kāda specifiska problēmas apgabala modeļus, izmantojo…

DatorzinātnesProgrammēšanas valodas un sistēmasComputer scienceProgramming Languages and Systems

researchProduct

Unambiguous recognizable two-dimensional languages

2006

We consider the family UREC of unambiguous recognizable two-dimensional languages. We prove that there are recognizable languages that are inherently ambiguous, that is UREC family is a proper subclass of REC family. The result is obtained by showing a necessary condition for unambiguous recognizable languages. Further UREC family coincides with the class of picture languages defined by unambiguous 2OTA and it strictly contains its deterministic counterpart. Some closure and non-closure properties of UREC are presented. Finally we show that it is undecidable whether a given tiling system is unambiguous.

DeterminismSettore INF/01 - InformaticaDeterministic context-free languageGeneral MathematicsTwo-dimensional languagesAutomata and formal languages; Determinism; Two-dimensional languages; UnambiguityComputer Science::Computation and Language (Computational Linguistics and Natural Language and Speech Processing)Class (philosophy)Computer Science ApplicationsUndecidable problemAutomata and Formal Languages. ; Unambiguity ; Determinism. .; Two-dimensional languagesCombinatoricsClosure (mathematics)Computer Science::Programming LanguagesAutomata and formal languagesDeterminism.ArithmeticComputer Science::Formal Languages and Automata TheorySoftwareUnambiguityMathematics

researchProduct

ON THE STAR HEIGHT OF RATIONAL LANGUAGES

1994

Two problems concerning the star height of a rational language are investigated: the star height one problem and the relationships between the unambiguity of an expression and its star height. For this purpose we consider the class of factorial, transitive and rational (FTR) languages. From the algebraic point of view a FTR language is the set of factors of a rational submonoid M. Two subclasses of FTR languages are introduced: renewal languages, corresponding to the case of M finitely generated, and unambiguous renewal languages, corresponding to the case of M finitely generated and free. We prove that a FTR language has star height one if and only if it is renewal. This gives a simple de…

Discrete mathematicsFactorialTransitive relationStar heightGeneral Mathematicsmedia_common.quotation_subjectComputer Science::Computation and Language (Computational Linguistics and Natural Language and Speech Processing)AmbiguityRegular languageIf and only ifComputer Science::Programming LanguagesEntropy (information theory)Algebraic numberMathematicsmedia_commonInternational Journal of Algebra and Computation

researchProduct

Quantum Finite Automata and Logics

2006

The connection between measure once quantum finite automata (MO-QFA) and logic is studied in this paper. The language class recognized by MO-QFA is compared to languages described by the first order logics and modular logics. And the equivalence between languages accepted by MO-QFA and languages described by formulas using Lindstrom quantifier is shown.

Discrete mathematicsLindström quantifierNested wordAbstract family of languagesComputer Science::Computation and Language (Computational Linguistics and Natural Language and Speech Processing)Computer Science::Computational ComplexityComputer Science::Digital LibrariesAlgebraTheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGESMonoidal t-norm logicComputer Science::Programming LanguagesQuantum finite automataEquivalence (formal languages)T-norm fuzzy logicsComputer Science::Formal Languages and Automata TheoryAND gateMathematics

researchProduct

On the Class of Languages Recognizable by 1-Way Quantum Finite Automata

2007

It is an open problem to characterize the class of languages recognized by quantum finite automata (QFA). We examine some necessary and some sufficient conditions for a (regular) language to be recognizable by a QFA. For a subclass of regular languages we get a condition which is necessary and sufficient. Also, we prove that the class of languages recognizable by a QFA is not closed under union or any other binary Boolean operation where both arguments are significant.

Discrete mathematicsNested wordComputer Science::Computation and Language (Computational Linguistics and Natural Language and Speech Processing)0102 computer and information sciences02 engineering and technologyComputer Science::Computational Complexityω-automaton01 natural sciencesDeterministic pushdown automatonDeterministic finite automatonRegular language010201 computation theory & mathematicsProbabilistic automaton0202 electrical engineering electronic engineering information engineeringComputer Science::Programming LanguagesQuantum finite automata020201 artificial intelligence & image processingNondeterministic finite automatonComputer Science::Formal Languages and Automata TheoryMathematics

researchProduct

Probabilities to Accept Languages by Quantum Finite Automata

1999

We construct a hierarchy of regular languages such that the current language in the hierarchy can be accepted by 1-way quantum finite automata with a probability smaller than the corresponding probability for the preceding language in the hierarchy. These probabilities converge to 1/2.

Discrete mathematicsTheoretical computer scienceNested wordFinite-state machineHierarchy (mathematics)Computer scienceComputer Science::Computation and Language (Computational Linguistics and Natural Language and Speech Processing)Turing machinesymbols.namesakeNonlinear Sciences::Exactly Solvable and Integrable SystemsRegular languageProbabilistic automatonAnalytical hierarchysymbolsComputer Science::Programming LanguagesQuantum finite automataQuantum algorithmNondeterministic finite automaton

researchProduct

XCDL: an XML-oriented visual composition definition language

2010

International audience; XML data flow has reached beyond the world of computer science and has spread to other areas such as data communication, e-commerce and instant messaging. Therefore, manipulating this data by non expert programmers is becoming imperative. On one hand, Mashups have emerged a few years ago, providing users with visual tools for web data manipulation but not necessarily XML specific. Mashups have been leaning towards functional composition but no formal languages have yet been defined. On the other hand, visual languages for XML have been emerging since the standardization of XML, and mostly relying on querying XML data for extraction or structure transformations. These…

researchProduct

Programming languages for data-Intensive HPC applications: A systematic mapping study

2020

This work is a result of activities from COST Action 10406 High -Performance Modelling and Simulation for Big Data Applications (cHiPSet), funded by the European Cooperation in Science and Technology. FCT, Portugal for grants: NOVA LINCS Research Laboratory Ref. UID/ CEC/ 04516/ 2019); INESC-ID Ref. UID/CEC/50021/2019; BioISI Ref. UID/MULTI/04046/2103; LASIGE Research Unit Ref. UID/CEC/00408/ 2019. A major challenge in modelling and simulation is the need to combine expertise in both software technologies and a given scientific domain. When High-Performance Computing (HPC) is required to solve a scientific problem, software development becomes a problematic issue. Considering the complexity…

Domain-Specific language (DSL)High performance computing (HPC)Computer scienceComputer Networks and CommunicationsBig data; Data-intensive applications; Domain-Specific language (DSL); General-Purpose language (GPL); High performance computing (HPC); Programming languages; Systematic mapping study (SMS)Systematic mapping study (SMS)Big dataData-intensive applicationsContext (language use)computer.software_genreTheoretical Computer ScienceSoftware portabilityBig dataSoftwareArtificial Intelligencebusiness.industryProgramming languageSoftware developmentGeneral-Purpose language (GPL)UsabilityProgramming languagesDigital libraryComputer Graphics and Computer-Aided DesignHardware and ArchitecturebusinesscomputerSoftware

researchProduct

Automated source code transformations on fourth generation languages

2004

To control the operation of large application suites or to tailor a special purpose application to particular need, developers frequently use application specific languages, such as batch, scripting, and query languages. These languages which are also referred to as fourth generation languages (4GLs) therefore play an important role in today's economy. Incompatibilities between different versions of 4GLs and changing requirements may make massive changes on a company's library of 4GL programs necessary. Here, we explore possibilities for performing mass changes on 4GLs and show how the transformation of programs written in 4GLs compares to the transformation of mainstream programming langua…

Domain-specific languageComputer scienceProgramming languagebusiness.industryComparison of multi-paradigm programming languagesSecond-generation programming languageOntology languageQuery languagecomputer.software_genreThird-generation programming languageFourth-generation programming languageFifth-generation programming languageSoftware engineeringbusinesscomputerEighth European Conference on Software Maintenance and Reengineering, 2004. CSMR 2004. Proceedings.

researchProduct