Results 41 to 50 of about 2,934 (199)
An Infinite Automaton Characterization of Double Exponential Time
, 2008 Infinite-state automata are a new invention: they are automata that have an infinite number of states represented by words, transitions defined using rewriting, and with sets of initial and final states.
Torre, Salvatore La +2 more
core +2 more sources
Quantitative Automata under Probabilistic Semantics [PDF]
Logical Methods in Computer Science, 2019 Automata with monitor counters, where the transitions do not depend on counter values, and nested weighted automata are two expressive automata-theoretic frameworks for quantitative properties. For a well-studied and wide class of quantitative functions,
Krishnendu Chatterjee +2 more
doaj +1 more source
A nationwide student survey on biochemistry learning resources in Italy
FEBS Open Bio, EarlyView.We conducted a survey among Italian university students to investigate their preferred study materials for biochemistry. We then analyzed the collected data to identify these materials. This information may be valuable to the Biochemistry educational community. The graphical abstract was created with Claude (Opus 5.5; Anthropic, 2026).
Anna Marabotti +4 more
wiley +1 more source
Unifying B\"uchi Complementation Constructions [PDF]
Logical Methods in Computer Science, 2013 Complementation of B\"uchi automata, required for checking automata containment, is of major theoretical and practical interest in formal verification. We consider two recent approaches to complementation.
Seth J. Fogarty +3 more
doaj +1 more source
J.UCS Special Issue on Formal Languages and Automata (WFLA)
, 1999 J.UCS Special Issue on Formal Languages and Automata ...
Mateescu,Alexandru, Mateescu, Alexandru
core +1 more source
History−Register Automata [PDF]
, 2013 Programs with dynamic allocation are able to create and use an unbounded number of fresh resources, such as references, objects, files, etc. We propose History-Register Automata (HRA), a new automata-theoretic formalism for modelling such programs. HRAs
Tzevelekos, Nikos +5 more
core +1 more source
FEBS Open Bio, EarlyView.Life‐science educators from 14 countries redesigned their own course materials with generative AI in a three‐session, pedagogy‐first FEBS Education and Training Academy workshop built on PICRAT. Among 12 matched respondents, four more reported high confidence in each of five practical domains, and 10 of 13 reported implementing at least one idea ...
Zvonimir Mlinarić, Ali Burak Özkaya
wiley +1 more source
Graph Logics with Rational Relations [PDF]
Logical Methods in Computer Science, 2013 We investigate some basic questions about the interaction of regular and rational relations on words. The primary motivation comes from the study of logics for querying graph topology, which have recently found numerous applications.
Pablo Barcelo +2 more
doaj +1 more source
Logical Methods in Computer Science, 2020 We introduce a class of algebras that can be used as recognisers for regular tree languages. We show that it is the only such class that forms a pseudo-variety and we prove the existence of syntactic algebras.
Achim Blumensath
doaj +1 more source
The hierarchy of formal languages and corresponding automata.
, 2019 The hierarchy of formal languages and corresponding automata.
Cedric Boeckx (453297) +1 more
core +1 more source