Search results for "Formal language"

showing 10 items of 357 documents

Representation of Autonomous Automata

2001

An autonomous automaton is a finite automaton with output in which the input alphabet has cardinality one when special reduced. We define the transition from automata to semigroups via a representation successful if given two incomparable automata (neither simulate the other), the semigroups representing the automata are distinct. We show that representation by the transition semigroup is not successful. We then consider a representation of automata by semigroups of partial transformations. We show that in general transition from automata to semigroups by this representation is not successful either. In fact, the only successful transition presented is the transiton to this semigroup of par…

Krohn–Rhodes theoryDiscrete mathematicsNested wordFinite-state machineMathematics::Operator AlgebrasComputer scienceSemigroupTimed automatonω-automatonNonlinear Sciences::Cellular Automata and Lattice GasesMobile automatonAutomatonNondeterministic finite automaton with ε-movesStochastic cellular automatonDeterministic finite automatonDFA minimizationDeterministic automatonContinuous spatial automatonSpecial classes of semigroupsQuantum finite automataAutomata theoryTwo-way deterministic finite automatonNondeterministic finite automatonComputer Science::Formal Languages and Automata Theory
researchProduct

Minimal Forbidden Factors of Circular Words

2017

Minimal forbidden factors are a useful tool for investigating properties of words and languages. Two factorial languages are distinct if and only if they have different (antifactorial) sets of minimal forbidden factors. There exist algorithms for computing the minimal forbidden factors of a word, as well as of a regular factorial language. Conversely, Crochemore et al. [IPL, 1998] gave an algorithm that, given the trie recognizing a finite antifactorial language M, computes a DFA of the language having M as set of minimal forbidden factors. In the same paper, they showed that the obtained DFA is minimal if the input trie recognizes the minimal forbidden factors of a single word. We gener…

L-automatonDiscrete mathematicsFactorialFibonacci numberSettore INF/01 - InformaticaComputer Science (all)Computer Science::Computation and Language (Computational Linguistics and Natural Language and Speech Processing)0102 computer and information sciences02 engineering and technologyCircular wordMinimal forbidden factor01 natural sciencesTheoretical Computer ScienceSet (abstract data type)010201 computation theory & mathematicsIf and only ifTrie0202 electrical engineering electronic engineering information engineering020201 artificial intelligence & image processingComputer Science::Formal Languages and Automata TheoryWord (computer architecture)Mathematics
researchProduct

Self-employment transitions and alternation in Finnish rural and urban labour markets

2008

.  This paper deals with the transitions and alternation between self-employment, paid-employment and non-employment in Finland in 1987–1999, paying special attention to differences in self-employment dynamics between areas characterized by different labour market conditions, viz. rural and urban locations. Markovian analysis reveals significant differences by the type of area in the processes of transition between the three labour market states. Alternation between self-employment and other labour markets states turns out to be greater in rural than urban areas. Five major types of alternating working careers are identified. The type of area is importantly related to alternating working ca…

Labour economicsPolitical scienceGeography Planning and Developmentself-employment alternation labour markets urban and ruralyrittäjyys vuorottelu dynamiikka alueelliset työmarkkinatAlternation (formal language theory)Environmental Science (miscellaneous)Self-employment
researchProduct

Vertical representation of C∞-words

2015

We present a new framework for dealing with C ∞ -words, based on their left and right frontiers. This allows us to give a compact representation of them, and to describe the set of C ∞ -words through an infinite directed acyclic graph G. This graph is defined by a map acting on the frontiers of C ∞ -words. We show that this map can be defined recursively and with no explicit reference to C ∞ -words. We then show that some important conjectures on C ∞ -words follow from analogous statements on the structure of the graph G.

Left and rightDiscrete mathematicsGeneral Computer ScienceComputer Science::Computation and Language (Computational Linguistics and Natural Language and Speech Processing)16. Peace & justiceDirected acyclic graphTheoretical Computer ScienceCombinatoricsDirected setRecursive functionsGraph (abstract data type)Null graphComputer Science::Formal Languages and Automata TheoryMathematicsofComputing_DISCRETEMATHEMATICSMathematicsTheoretical Computer Science
researchProduct

Photoreceptors, lightness constancy and color vision.

1986

LightnessColor constancyLightbusiness.industryColor visionColour VisionGeneral MedicineCone (formal languages)FluorescenceOpticsHumansPhotoreceptor CellsScotopic visionbusinessEcology Evolution Behavior and SystematicsColor PerceptionLightingMathematicsDie Naturwissenschaften
researchProduct

Mapping wordnets from the perspective of inter-lingual equivalence

2017

Mapping wordnets from the perspective of inter-lingual equivalence This paper explores inter-lingual equivalence from the perspective of linking two large lexico-semantic databases, namely the Princeton WordNet of English and the plWordnet ( pl. Slowosiec ) of Polish. Wordnets are built as networks of lexico-semantic relations between words and their meanings, and constitute a type of monolingual dictionary cum thesaurus. The development of wordnets for different languages has given rise to many wordnet linking projects (e.g. EuroWordNet, Vossen, 2002). Regardless of a linking method used, these projects require defining rules for establishing equivalence links between wordnet building bloc…

Linguistics and LanguageComputer Networks and CommunicationsWordNetequivalencetranslationcomputer.software_genrelcsh:P325-325.5Polish wordnet (Słowosieć)Equivalence (formal languages)Princeton WordnetMathematicsbusiness.industryCommunicationlcsh:P98-98.5lcsh:LexicographyLexicographywordnet mappingArtificial intelligencebilingual lexicographylcsh:Computational linguistics. Natural language processingbusinesscomputerlcsh:P327-327.5Natural language processingEuroWordNetlcsh:SemanticsCognitive Studies / Etudes Cognitives (former title: Studia Kognitywne)
researchProduct

Contrasting the form and use of reformulation markers

2007

This article deals with the form and use of reformulation markers in research papers written in English, Spanish and Catalan. Considering the form and frequency of the markers, English papers tend to prefer simple fixed markers and include fewer reformulators than Spanish and Catalan. On the contrary, formal Catalan and Spanish papers include more markers, some of which are complex and allow for some structural variability. As for use, reformulation markers establish dynamic relationships between portions of discourse which can be identified in our corpus with expansion, reduction and permutation. The analysis of the corpus shows that English authors usually reformulate to add more informa…

Linguistics and LanguageLingüística contrastivaSocial PsychologyComputer scienceAnglès -- Gramàtica comparada -- CatalàCastellà -- Gramàtica comparada -- Anglès050109 social psychologyCatalà -- Gramàtica comparada -- Anglèscomputer.software_genreEquivalenceLanguage and LinguisticsParaphraseMarcadors discursius0501 psychology and cognitive sciencesEquivalence (formal languages)Contrastive linguisticsContrastive linguistics060201 languages & linguisticsbusiness.industryCommunicationAnglès -- Gramàtica comparada -- Castellà05 social sciences06 humanities and the artsLinguisticslanguage.human_languageParaphraseReformulation markersSpecialized discourseReformulationAnthropology0602 languages and literaturelanguageCatalanArtificial intelligencebusinesscomputerNatural language processingDiscourse Studies
researchProduct

A quantitative survey of N Prep N constructions in Romance languages and prepositional variability

2018

The distinction between syntagmatic compounds of the type N Prep N, such as Fr. jouet d’enfant, and nominal syntagms of the type N Prep N, such as the partially equivalent Fr. jouet pour enfants, remains unclear and vague. This is mainly because the lexical and syntactic status of syntagmatic compounds still is controversial. In some cases, as in jouet d’enfant and jouet pour enfants, partial equivalent syntagmatic compounds and nominal syntagms may coexist and underlie a specific variation and alternation. In other cases, such as Pt. bracelete de aço and bracelete em aço, two variants of a syntagmatic compound may alternate and coexist. The first part of this paper provides an overview of …

Linguistics and LanguageSyntagmatic analysisQuantitative surveyRomance languagesWord formationLanguage and Linguisticslanguage.human_languageLinguisticsFocus (linguistics)Variation (linguistics)languageAlternation (formal language theory)PortugueseMathematics
researchProduct

A differential equation approach to implicit sweeping processes

2019

International audience; In this paper, we study an implicit version of the sweeping process. Based on methods of convex analysis, we prove the equivalence of the implicit sweeping process with a differential equation, which enables us to show the existence and uniqueness of the solution to the implicit sweeping process in a very general framework. Moreover, this equivalence allows us to give a characterization of nonsmooth Lyapunov pairs and invariance for implicit sweeping processes. The results of the paper are illustrated with two applications to quasistatic evolution variational inequalities and electrical circuits.

Lyapunov functionDifferential equation01 natural scienceslaw.inventionsymbols.namesakeEvolution variational inequalitylawApplied mathematicsUniqueness0101 mathematicsEquivalence (formal languages)[MATH]Mathematics [math]MathematicsConvex analysisApplied Mathematics010102 general mathematicsNonsmooth Lyapunov pairs010101 applied mathematicsregularizationMSC: 49J40 47J20 47J22 34G25 58E35 37L45Electrical networkVariational inequalitysymbolsMoreau's sweeping processAnalysisQuasistatic process
researchProduct

Semantic Word Error Rate for Sentence Similarity

2016

Sentence similarity measures have applications in several tasks, including: Machine Translation, Paraphrase Iden- tification, Speech Recognition, Question-answering and Text Summarization. However, measures designed for these tasks are aimed at assessing equivalence rather than resemblance, partly departing from human cognition of similarity. While this is reasonable for these activities, it hinders the applicability of sentence similarity measures to other tasks. We therefore propose a new sentence similarity measure specifically designed for resemblance evaluation, in order to cover these fields better. Experimental results are discussed.

Machine translationComputer scienceSpeech recognitionWord error rate02 engineering and technologycomputer.software_genreParaphrase030507 speech-language pathology & audiology03 medical and health sciencesSemantic similarityArtificial IntelligenceLSAWord Error Rate0202 electrical engineering electronic engineering information engineeringsentence resemblanceEquivalence (formal languages)Latent Semantic AnalysiSemantic Word Error Ratesentence similarity measureSWERbusiness.industryLatent semantic analysisSentence SimilaritySemantic ComputingCognitionAutomatic summarizationComputer Networks and Communicationword relatedne020201 artificial intelligence & image processingArtificial intelligence0305 other medical sciencebusinesscomputerNatural language processingWERInformation Systems2016 IEEE Tenth International Conference on Semantic Computing (ICSC)
researchProduct