Search results for "languages"
showing 10 items of 2101 documents
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.
Finite Automata with Advice Tapes
2013
We define a model of advised computation by finite automata where the advice is provided on a separate tape. We consider several variants of the model where the advice is deterministic or randomized, the input tape head is allowed real-time, one-way, or two-way access, and the automaton is classical or quantum. We prove several separation results among these variants, and establish the relationships between this model and the previously studied ways of providing advice to finite automata.
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.
Solving the boolean satisfiability problem using multilevel techniques
2011
Masteroppgave i informasjons- og kommunikasjonsteknologi IKT590 2011 – Universitetet i Agder, Grimstad There are many complex problems in computer science that occur in knowledge-representation (artificial thinking), artificial learning, Very Large Scale Integration (VLSI) design, security protocols and other areas. These complex problems may be deduced into satisfiability problems where the Boolean Satisfiability Problem (SAT) may be applied. This deduction is made in order to simplify complex problems into a specific propositional logic problem. The SAT problem is the most well-known nondeterministic polynomial time (NP) complete problem in computer science. It is a Boolean expression whi…
Digital calculus: Cellular automata dynamics in closed form
2015
A simple mathematical expression for the universal map for cellular automata is found in closed form with the help of a digit function, whose most basic properties are established. This result is found after proving a theorem on the composition of functions on finite sets. The expression (and the technique used to obtain it) opens the possibility of gaining mathematical insight in any cellular automaton rule since it constitutes at the same time a simple and fast algorithm to implement any such rule.
La ontología de la proposición en el Russell de "The Principles of Mathematics" y los artículos de Meinong
2005
Bertrand Russell, in The Principles of Mathematics and ¿Meinong¿s Theory of Complexes and Assumptions¿, maintains a unitary conception of the ontology of propositions. He makes a difference between judgment and proposition. Propositions are independent entities and they have different presentations. False propositions subsist; this is related to the relation in the proposition called ¿affirmation¿ and the double condition of predicates (meaning and term). But that conception has bad consequences for the unity and identity of proposition.
La forma de los entes matemáticos en The Principles of Mathematics de Bertrand Russell.
2011
The critic against subject-predicate propositions is a Russell's feature. See for example A Critical Exposition of the Philosophy of Leibniz. However, in The Principles of Mathematics Russell goes back to the subject-predicate form but in the context of his contribuition to the development of Modern Logic and his philosophy of mathematics
Lógicas epistémicas y sistemas multiagentes: los agentes nacen y mueren
2008
In this paper we study the propositional epistemic logics with operators to analize the knowledge of a group, and its applications to the multi-agent systems when the number of agents can vary between different worlds or states.
MOESM2 of Global mapping of randomised trials related articles published in high-impact-factor medical journals: a cross-sectional analysis
2020
Additional file 2. Data extraction and normalisation processes.
MOESM2 of Global mapping of randomised trials related articles published in high-impact-factor medical journals: a cross-sectional analysis
2020
Additional file 2. Data extraction and normalisation processes.