Results 81 to 90 of about 2,186 (279)
Groups, languages and automata
group theory, formal languages, finite state automata, decision problems, word problem, automatic groups, hyperbolic ...
Holt DF, Rees S, Rover CE
core +2 more sources
Deterministic pushdown automata can compress some normal sequences [PDF]
Logical Methods in Computer ScienceIn this paper, we give a deterministic pushdown transducer and a normal sequence of digits compressed by it. This solves positively a question left open in a previous paper by V. Becher, P. A. Heiber and the first author.
Olivier Carton, Sylvain Perifel
doaj +1 more source
Economic Impact of Sustainability in Wine Sector: A Systematic Literature Review
Agribusiness, EarlyView.ABSTRACT Sustainability has become a key issue in the wine sector, raising questions about its compatibility with firms' economic performance. Despite growing attention to environmental and social practices, evidence on their economic implications remains fragmented.
Valentina Di Chiara +2 more
wiley +1 more source
Finite-valued Streaming String Transducers [PDF]
TheoretiCSA transducer is finite-valued if for some bound k, it maps any given input to at most k outputs. For classical, one-way transducers, it is known since the 80s that finite valuedness entails decidability of the equivalence problem.
Emmanuel Filiot +5 more
doaj +1 more source
Automata Theory and Formal Languages
, 2013 In this book we present some basic notions and results on Automata Theory, For- mal Language Theory, Computability Theory, and Parsing Theory. In particular, we consider the class of regular languages which are related to the class of finite automata ...
Alberto Pettorossi
core
On the expressiveness of spider diagrams and commutative star-free regular languages [PDF]
, 2013 Spider diagrams provide a visual logic to express relations between sets and their elements, extending the expressiveness of Venn diagrams. Sound and complete inference systems for spider diagrams have been developed and it is known that they are ...
Taylor, John +3 more
core +1 more source
AIChE Journal, EarlyView.ABSTRACT Conceptual process design combines discrete configuration choices with continuous operating decisions, often yielding difficult mixed‐integer nonlinear or simulation‐based optimization problems. This work presents an exploratory computational assessment of Ising‐based solvers, simulated annealing, quantum annealing, and entropy computing, as ...
Yirang Park, David E. Bernal Neira
wiley +1 more source
Constructing Deterministic Parity Automata from Positive and Negative Examples [PDF]
TheoretiCSWe present a polynomial time algorithm that constructs a deterministic parity automaton (DPA) from a given set of positive and negative ultimately periodic example words. We show that this algorithm is complete for the class of $\omega$-regular languages,
León Bohn, Christof Löding
doaj +1 more source
MolMiner: Toward Controllable, Three‐Dimensional‐Aware, Fragment‐Based Molecular Design
Advanced Intelligent Discovery, EarlyView.MolMiner is a fragment‐based, geometry‐aware, and order‐agnostic generative model for molecular design with strong inductive biases. Using symmetry‐aware fragment assembly, dynamic three‐dimensional geometry, and multi‐property conditioning, MolMiner enables interpretable and controllable molecular generation.
Raul Ortega‐Ochoa +2 more
wiley +1 more source
Formal Analysis of the Contract Automata Runtime Environment with Uppaal: Modelling, Verification and Testing [PDF]
Logical Methods in Computer ScienceRecently, a distributed middleware application called contract automata runtime environment (CARE) has been introduced to realise service applications specified using a dialect of finite-state automata.
Davide Basile
doaj +1 more source