Results 141 to 150 of about 4,638,570 (374)
On Store Languages of Language Acceptors
, 2018 It is well known that the "store language" of every pushdown automaton -- the set of store configurations (state and stack contents) that can appear as an intermediate step in accepting computations -- is a regular language.
Ibarra, Oscar H., McQuillan, Ian
core +1 more source
Beyond-Regular Typestate [PDF]
arXiv, 2017 We present an extension for regular typestates, called Beyond- Regular Typestate(BR-Typestate), which is expressive enough to model non-regular properties of programs and protocols over data. We model the BR-Typestate system over a dependently typed, state based, impera- tive core language, and we prove its soundness and tractability.
arxiv
Advanced Engineering Materials, EarlyView.When realized as inserts in high‐pressure die casting, aluminum cooling channels for electric powertrain components and similar applications typically require a stabilizing filler to survive the process. The present study investigates relinquishing this filler using additively manufactured inserts promising performance improvements.
Dirk Lehmhus +9 more
wiley +1 more source
On a subclass of ∞-regular languages
Theoretical Computer Science, 1988 AbstractG-machines are considered as generators of sets of finite and infinite sequences, called G-languages. This paper focuses on the characterization of G-languages in terms of ∞-regular languages. It is shown that the class of G-languages is a proper subclass of the class of ∞-regular languages. It is also pointed out that the deterministic version
openaire +2 more sources
Computational parallels between the regular and context-free languages [PDF]
, 1974 Harry B. Hunt, Daniel J. Rosenkrantz
openalex +1 more source
Advanced Engineering Materials, EarlyView.The influence of Hot Isostatic Pressing (HIP) temperature on the microstructure and creep performance of powder bed fusion–laser beam processed CM247LC superalloy is investigated. Grain growth and γ’ precipitate evolution are characterized following HIP at varying temperatures.
Ahmed Fardan +4 more
wiley +1 more source
Regular splicing languages and subclasses
Theoretical Computer Science, 2005 AbstractRecent developments in the theory of finite splicing systems have revealed surprising connections between long-standing notions in the formal language theory and splicing operation. More precisely, the syntactic monoid and Schützenberger constant have strong interaction with the investigation of regular splicing languages.
BONIZZONI, PAOLA, MAURI, GIANCARLO
openaire +2 more sources
Constructing Concise Characteristic Samples for Acceptors of Omega Regular Languages [PDF]
Logical Methods in Computer ScienceA characteristic sample for a language $L$ and a learning algorithm $\textbf{L}$ is a finite sample of words $T_L$ labeled by their membership in $L$ such that for any sample $T \supseteq T_L$ consistent with $L$, on input $T$ the learning algorithm ...
Dana Angluin, Dana Fisman
doaj +1 more source
Advanced Functional Materials, EarlyView.PBTTT‐OR‐R, a C14‐alkoxy/alkyl‐PBTTT polymer derivative, is of substantial interest for optoelectronics due to its specific fullerene intercalation behavior and enhanced charge‐transfer absorption. Comparing this polymer with (S) and without (O) homocoupling defects reveals that PBTTT‐OR‐R(O) forms stable co‐crystals with PC61BM, while PBTTT‐OR‐R(S ...
Zhen Liu +14 more
wiley +1 more source
Conditional Densities of Regular Languages
Electronic Notes in Theoretical Computer Science, 2005 AbstractWe define a density of a given language S in a given language L as an asymptotic probability that a randomly and uniformly chosen word of length n from L belongs to S. There are languages for which densities do not exist. We show that a problem of checking whether one regular language has a density in another regular language is decidable.
openaire +3 more sources