Results 61 to 70 of about 46,330 (328)
Regular Cost Functions, Part I: Logic and Algebra over Words [PDF]
Logical Methods in Computer Science, 2013 The theory of regular cost functions is a quantitative extension to the classical notion of regularity. A cost function associates to each input a non-negative integer value (or infinity), as opposed to languages which only associate to each input the ...
Thomas Colcombet
doaj +1 more source
Towards a Uniform Theory of Effectful State Machines
, 2020 Using recent developments in coalgebraic and monad-based semantics, we present a uniform study of various notions of machines, e.g. finite state machines, multi-stack machines, Turing machines, valence automata, and weighted automata.
Goncharov, Sergey +2 more
core +2 more sources
Automatic functions, linear time and learning [PDF]
Logical Methods in Computer Science, 2013 The present work determines the exact nature of {\em linear time computable} notions which characterise automatic functions (those whose graphs are recognised by a finite automaton). The paper also determines which type of linear time notions permit full
John Case +3 more
doaj +1 more source
, 2008 Almost four decades have passed since Formal Grammars first appeared in 1974. At that time it was still possible to rather comprehensively review for (psycho)linguists the relevant literature on the theory of formal languages and automata, on their ...
W. Levelt
semanticscholar +1 more source
Reachability in Higher-Order-Counters
, 2013 Higher-order counter automata (\HOCS) can be either seen as a restriction of higher-order pushdown automata (\HOPS) to a unary stack alphabet, or as an extension of counter automata to higher levels.
A. Bouajjani +11 more
core +1 more source
Highly Undecidable Problems For Infinite Computations [PDF]
, 2009 We show that many classical decision problems about 1-counter omega-languages, context free omega-languages, or infinitary rational relations, are $\Pi_2^1$-complete, hence located at the second level of the analytical hierarchy, and "highly undecidable".
Finkel, Olivier
core +6 more sources
On Varieties of Automata Enriched with an Algebraic Structure (Extended Abstract)
, 2014 Eilenberg correspondence, based on the concept of syntactic monoids, relates varieties of regular languages with pseudovarieties of finite monoids.
Klíma, Ondřej
core +4 more sources
Quantitative Languages Defined by Functional Automata [PDF]
Logical Methods in Computer Science, 2015 A weighted automaton is functional if any two accepting runs on the same finite word have the same value. In this paper, we investigate functional weighted automata for four different measures: the sum, the mean, the discounted sum of weights along edges
Emmanuel Filiot +2 more
doaj +1 more source
Towards Nominal Formal Languages [PDF]
, 2011 We introduce formal languages over infinite alphabets where words may contain binders. We define the notions of nominal language, nominal monoid, and nominal regular expressions.
Kurz, Alexander +2 more
core +2 more sources
FEBS Open Bio, EarlyView.This study presents a novel approach to teaching Python and bioinformatics using team‐based learning and cloud‐hosted notebooks. By integrating interactive coding into biomedical education, the method improves accessibility, student engagement, and confidence—especially for those without a computing background.
Nuno S. Osório, Leonardo D. Garma
wiley +1 more source