Results 51 to 60 of about 157,848 (165)
Simultaneous Finite Automata: An Efficient Data-Parallel Model for Regular Expression Matching [PDF]
, 2013 Automata play important roles in wide area of computing and the growth of multicores calls for their efficient parallel implementation. Though it is known in theory that we can perform the computation of a finite automaton in parallel by simulating ...
862 +5 more
core +2 more sources
, 2019 In algebraic terms, the insertion of $n$-powers in words may be modelled at the language level by considering the pseudovariety of ordered monoids defined by the inequality $1\le x^n$.
Almeida, J., Klíma, O.
core +1 more source
Automata Minimization: a Functorial Approach
, 2020 In this paper we regard languages and their acceptors - such as deterministic or weighted automata, transducers, or monoids - as functors from input categories that specify the type of the languages and of the machines to categories that specify the type
Colcombet, Thomas, Petrişan, Daniela
core +1 more source
Eilenberg Theorems for Free [PDF]
, 2017 Eilenberg-type correspondences, relating varieties of languages (e.g. of finite words, infinite words, or trees) to pseudovarieties of finite algebras, form the backbone of algebraic language theory.
Adámek, Jiří +3 more
core +2 more sources
Tree Languages Defined in First-Order Logic with One Quantifier Alternation [PDF]
, 2010 We study tree languages that can be defined in \Delta_2 . These are tree languages definable by a first-order formula whose quantifier prefix is forall exists, and simultaneously by a first-order formula whose quantifier prefix is .
Bojanczyk, Mikolaj, Segoufin, Luc
core +7 more sources
Law and Order for Typestate with Borrowing [PDF]
Proc. ACM Program. Lang.Typestate systems are notoriously complex as they require sophisticated machinery for tracking aliasing. We propose a new, transition-oriented foundation for typestate in the setting of impure functional programming.
Hannes Saffrich +2 more
semanticscholar +1 more source
On the group of a rational maximal bifix code
, 2018 We give necessary and sufficient conditions for the group of a rational maximal bifix code $Z$ to be isomorphic with the $F$-group of $Z\cap F$, when $F$ is recurrent and $Z\cap F$ is rational. The case where $F$ is uniformly recurrent, which is known to
Almeida, Jorge +3 more
core +1 more source
Logics with rigidly guarded data tests [PDF]
, 2014 The notion of orbit finite data monoid was recently introduced by Bojanczyk as an algebraic object for defining recognizable languages of data words.
Colcombet, Thomas +2 more
core +8 more sources
Finite Countermodel Based Verification for Program Transformation (A Case Study) [PDF]
, 2015 Both automatic program verification and program transformation are based on program analysis. In the past decade a number of approaches using various automatic general-purpose program transformation techniques (partial deduction, specialization ...
Lisitsa, Alexei P., Nemytykh, Andrei P.
core +2 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 +2 more sources