Search results for "Powers"

showing 10 items of 58 documents

ON-LINE CONSTRUCTION OF A SMALL AUTOMATON FOR A FINITE SET OF WORDS

2012

In this paper we describe a "light" algorithm for the on-line construction of a small automaton recognising a finite set of words. The algorithm runs in linear time. We carried out good experimental results on real dictionaries, on biological sequences and on the sets of suffixes (resp. factors) of a set of words that shows how our automaton is near to the minimal one. For the suffixes of a text, we propose a modified construction that leads to an even smaller automaton. We moreover construct linear algorithms for the insertion and deletion of a word in a finite set, directly from the constructed automaton.

minimal automata[INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS]Timed automatondeterministic automataBüchi automaton0102 computer and information sciences02 engineering and technology01 natural sciencesDeterministic automaton0202 electrical engineering electronic engineering information engineeringComputer Science (miscellaneous)Two-way deterministic finite automatonNondeterministic finite automatonMathematicsonline construction.Discrete mathematicsSettore INF/01 - InformaticaPowerset constructionPushdown automatonComputer Science::Computation and Language (Computational Linguistics and Natural Language and Speech Processing)010201 computation theory & mathematicsProbabilistic automaton020201 artificial intelligence & image processingFinite set of wordAlgorithmComputer Science::Formal Languages and Automata Theory
researchProduct

Automata and forbidden words

1998

Abstract Let L ( M ) be the (factorial) language avoiding a given anti-factorial language M . We design an automaton accepting L ( M ) and built from the language M . The construction is effective if M is finite. If M is the set of minimal forbidden words of a single word ν, the automaton turns out to be the factor automaton of ν (the minimal automaton accepting the set of factors of ν). We also give an algorithm that builds the trie of M from the factor automaton of a single word. It yields a nontrivial upper bound on the number of minimal forbidden words of a word.

TheoryofComputation_COMPUTATIONBYABSTRACTDEVICES[INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS]Büchi automaton0102 computer and information sciences02 engineering and technologyω-automaton01 natural sciencesTheoretical Computer ScienceCombinatoricsDeterministic automaton0202 electrical engineering electronic engineering information engineeringTwo-way deterministic finite automatonNondeterministic finite automatonMathematicsPowerset constructionLevenshtein automaton020206 networking & telecommunicationsComputer Science::Computation and Language (Computational Linguistics and Natural Language and Speech Processing)Nonlinear Sciences::Cellular Automata and Lattice GasesComputer Science ApplicationsTheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGES010201 computation theory & mathematicsSignal ProcessingProbabilistic automatonComputer Science::Programming LanguagesComputer Science::Formal Languages and Automata TheoryInformation Systems
researchProduct

Recensione a YVES MÉNY, Democrazia: l’eredità politica greca. Miti - potere - istituzioni, Milano, Ariele, 2022

2022

è la recensione al libro scritto da Yves Mény. It is a review of the book written by Yves Mény.

istituzioni poteri mitiSettore IUS/10 - Diritto Amministrativoinstitutions powers myths
researchProduct

Vigencia de los derechos constitucionales en el Estado de Excepción con motivo de la emergencia sanitaria del COVID-19.

2021

El Estado de Excepción es una figura jurídica excepcional, que el jefe de Estado decreta frente a situaciones cuya solución escapan la actuación ordinaria, como la pandemia por el COVID–19; en este contexto, el presidente constitucional del Ecuador en uso de sus atribuciones, promulgó el 16 de marzo del 2020, el Decreto No. 1017 de Estado de Excepción y posterior solicitud de prórroga. El presente artículo tiene como objetivo analizar la vigencia de los derechos constitucionales en el Estado de Excepción con motivo de la emergencia sanitaria del COVID-19. Entre los resultados que arrojó la investigación, tenemos que el control constitucional, es un elemento que garantiza equilibrio en la se…

DecreeCoronavirus disease 2019 (COVID-19)State (polity)Political sciencemedia_common.quotation_subjectConstitutional stateSeparation of powersContext (language use)Element (criminal law)State of exceptionHumanitiesmedia_commonDilemas contemporáneos: Educación, Política y Valores
researchProduct

Golden Power, emergenza Covid-19 e spirito del tempo

2020

L’articolo ha ad oggetto l’ampliamento dei poteri speciali del Governo in materia di aziende strategiche (c.d. Golden Power), previsto dalle disposizioni introdotte dal d.l. 8 aprile 2020 n. 23, nell’ambito della produzione normativa legata all’emergenza Covid-19. Nel procedere ad una un’analisi del testo, il lavoro si interroga sul rapporto fra la nuova disciplina e le esigenze poste dalla pandemia, e con il più generale “spirito del tempo” in tema di protezione dei sistemi economici nazionali. The article refers to the enlargement of governmental special powers regarding strategic business entities (so called Golden Power), according to the new rules issued by decree 8 April 2020 n. 23, w…

golden power share società strategiche poteri speciali covid-19 protezione nazionale economiaspecial powers zeitgeist covid.19 golden share strategic national business entities company corporation protectionSettore IUS/04 - Diritto Commerciale
researchProduct

Il doppio mito: sulla (pretesa) neutralità della politica monetaria della BCE e la (pretesa) non-vincolatività degli indirizzi di politica economica …

2021

Policies adopted by the governance of the EMU during the financial and Covid crises display a clear gap between the “form” and the “substance” of the institutional architecture of title VIII of the TFEU. It is submitted that this architecture is in sharp contrast with the European constitutional tradition. Furthermore, the traditional view is rejected, according to which the EU Commission and Council, as well as the ECB, are devoid of binding powers in the field of economic policy. Some reflections concerning both methodological implications of the foregoing and its possible effects on the European integration process are finally developed

Settore IUS/14 - Diritto Dell'Unione EuropeaEuropean monetary union (EMU) title VIII TFEU institutional architecture european constitutional tradition EU Commission EU Council and ECB alleged absence of binding powers European integration processSettore IUS/13 - Diritto Internazionale
researchProduct

‘The Iraq War Momentum’ in the Struggle on the Powers of the US Congress

2019

How parliaments and legislatures participate in war-making has raised interest among researchers from different disciplines, including constitutional law and political science. While war powers are usually considered to be included in the field of the executive branch, parliaments have played an increasingly relevant role as more democratic decision-making in both normal and exceptional times has gained prominence. The comparative aspect to examine war powers between parliaments or between the branches of government is often adopted to describe the authority and legitimacy of these powers. The US Congress is considered to have strong war powers on paper compared to parliaments in other libe…

Historyseparation of powersSociology and Political Scienceparlamentarismimedia_common.quotation_subjectvallankäyttömomentumsotatoimetiraq warGender StudiesPoliticsIraq Warkeskusteluus congressdebatesPolitical scienceUS Congress; debates; Iraq War; momentum; separation of powersConstitutional lawasevoimatLegitimacyUse of forcemedia_commonparlamentitSeparation of powersLegislatureUS CongressLiberal democracylcsh:JC11-607lcsh:Women. Feminismlcsh:Political theoryDemocracyYhdysvallatLawYhdysvaltain kongressilcsh:HQ1101-2030.7
researchProduct

Implantations, activités et relations des établissements d'assistance en Bourgogne à la fin du Moyen Age

2012

The study presented here is the conclusion of an inventory about hospitals having existed on the territory of some dioceses (Autun, Auxerre, Chalon-sur-Saône, Nevers and the south of that of Langres diocese) between XIIth and XVth centuries. Based on the data collected, an atlas of assistance and a directory of sources on medieval hospitals of the study area has been made. The compiled informations proved to be very different but also very heterogeneous. Nevertheless, reflexions were conducted about the characteristics of these hospitals and their relationships with their economic, religious, political and social environments. It revolves around three parts dealing by turns the influence of…

Poverty DiseaseMoyen ÂgePilgrimage[ SHS.HIST ] Humanities and Social Sciences/HistoryAssistancePauvretéCharitéPèlerinageTerritorialitéHospital[SHS.HIST] Humanities and Social Sciences/HistoryCharityPouvoirsPowersMaladieMiddle AgesNetworksTerritorialityRéseaux[SHS.HIST]Humanities and Social Sciences/HistoryBurgundyHôpital
researchProduct

Minimal forbidden words and factor automata

1998

International audience; Let L(M) be the (factorial) language avoiding a given antifactorial language M. We design an automaton accepting L(M) and built from the language M. The construction is eff ective if M is finite. If M is the set of minimal forbidden words of a single word v, the automaton turns out to be the factor automaton of v (the minimal automaton accepting the set of factors of v). We also give an algorithm that builds the trie of M from the factor automaton of a single word. It yields a non-trivial upper bound on the number of minimal forbidden words of a word.

TheoryofComputation_COMPUTATIONBYABSTRACTDEVICESfailure functionfactor code[INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS]Büchi automatonComputerApplications_COMPUTERSINOTHERSYSTEMS[INFO.INFO-DS] Computer Science [cs]/Data Structures and Algorithms [cs.DS]0102 computer and information sciencesavoiding a wordω-automaton01 natural sciencesfactorial languageReversible cellular automatonCombinatoricsDeterministic automatonanti-factorial languageNondeterministic finite automaton0101 mathematicsMathematicsfactor automatonPowerset constructionLevenshtein automaton010102 general mathematicsforbidden wordComputer Science::Computation and Language (Computational Linguistics and Natural Language and Speech Processing)16. Peace & justiceNonlinear Sciences::Cellular Automata and Lattice GasesTheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGES010201 computation theory & mathematicsProbabilistic automatonPhysics::Accelerator PhysicsComputer Science::Programming LanguagesHigh Energy Physics::ExperimentComputer Science::Formal Languages and Automata Theory
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