Results 31 to 40 of about 307 (62)
Kunz languages for numerical semigroups are context sensitive
, 2023 There is a one-to-one and onto correspondence between the class of numerical semigroups of depth $n$, where $n$ is an integer, and a certain language over the alphabet $\{1,\ldots,n\}$ which call Kunz language of depth $n$.
Cubertorer, Usó i, Delgado, Manuel
core
Alternating weak automata from universal trees [PDF]
, 2019 An improved translation from alternating parity automata on infinite words to alternating weak automata is given. The blow-up of the number of states is related to the size of the smallest universal ordered trees and hence it is quasi-polynomial, and it ...
Daviaud, Laure +2 more
core +1 more source
String Diagrammatic Trace Theory
, 2023 We extend the theory of formal languages in monoidal categories to the multi-sorted, symmetric case, and show how this theory permits a graphical treatment of topics in concurrency.
Earnshaw, Matthew, Sobociński, Paweł
core
Diffraction Patterns of Layered Close-packed Structures from Hidden Markov Models
, 2014 We recently derived analytical expressions for the pairwise (auto)correlation functions (CFs) between modular layers (MLs) in close-packed structures (CPSs) for the wide class of stacking processes describable as hidden Markov models (HMMs) [Riechers ...
Crutchfield, J. P. +2 more
core
Classical and quantum Merlin-Arthur automata
, 2022 We introduce Merlin-Arthur (MA) automata as Merlin provides a single certificate and it is scanned by Arthur before reading the input. We define Merlin-Arthur deterministic, probabilistic, and quantum finite state automata (resp., MA-DFAs, MA-PFAs, MA ...
Yakaryılmaz, Abuzer
core
Weighted languages recognizable by weighted tree automata [PDF]
, 2018 Yields of recognizable weighted tree languages, yields of local weighted tree languages, and weighted context-free languages are related. It is shown that the following five classes of weighted languages are the same: (i) the class of weighted languages ...
Fülöp Zoltán, Gazdag Zsolt
core
Primitive Automata that are Synchronizing
, 2023 A deterministic finite (semi)automaton is primitive if its transition monoid (semigroup) acting on the set of states has no non-trivial congruences. It is synchronizing if it contains a constant map (transformation).
Rystsov, Igor, Szykuła, Marek
core
Measuring the Gain of Reconfigurable Communication
, 2023 We study the advantages of reconfigurable communication interfaces vs fixed communication interfaces in the context of asynchronous automata. We study the extension of asynchronous (Zielonka) automata with reconfigurable communication interfaces. We show
Lehaut, Mathieu, Piterman, Nir
core
Quantitative estimates for the size of an intersection of sparse automatic sets
, 2023 A theorem of Cobham says that if $k$ and $\ell$ are two multiplicatively independent natural numbers then a subset of the natural numbers that is both $k$- and $\ell$-automatic is eventually periodic.
Albayrak, Seda, Bell, Jason
core
On Some Closure Properties of nc-eNCE Graph Grammars
, 2023 In the study of automata and grammars, closure properties of the associated languages have been studied extensively. In particular, closure properties of various types of graph grammars have been examined in (Rozenberg and Welzl, Inf.
Mathew, Lisa, Vijayakumar, Jayakrishna
core