Results 71 to 80 of about 283,589 (317)
Constructing a realtime deterministic pushdown automaton from a grammar
Theoretical Computer Science, 1983 AbstractA new direct construction from a grammar to a realtime deterministic pushdown automation is presented. The grammar is required to be in a special form, but the construction is more natural than previously known constructions. As a result the family of stack uniform strict deterministic languages can be characterized by a grammar family.
Pittl, Jan, Yehudai, Amiram
openaire +2 more sources
Ice Lithography: Recent Progress Opens a New Frontier of Opportunities
Advanced Functional Materials, EarlyView.This review focuses on recent advancements in ice lithography, including breakthroughs in compatible precursors and substrates, processes and applications, hardware, and digital methods. Moreover, it offers a roadmap to uncover innovation opportunities for ice lithography in fields such as biological, nanoengineering and microsystems, biophysics and ...
Bingdong Chang +9 more
wiley +1 more source
Testing the Equivalence of Regular Languages [PDF]
Electronic Proceedings in Theoretical Computer Science, 2009 The minimal deterministic finite automaton is generally used to determine regular languages equality. Antimirov and Mosses proposed a rewrite system for deciding regular expressions equivalence of which Almeida et al.
Marco Almeida +2 more
doaj +1 more source
Advanced Functional Materials, EarlyView.Guided by the golden ratio, a class of aperiodic architected metamaterials is introduced to address the intrinsic trade‐off between strength and toughness. By unifying local geometric heterogeneity with global order, the golden‐ratio‐guided aperiodic architecture promotes spatial delocalization of damage tolerence regions, leading to more tortuous ...
Junjie Deng +9 more
wiley +1 more source
Answer Set Programming for Regular Inference
Applied Sciences, 2020 We propose an approach to non-deterministic finite automaton (NFA) inductive synthesis that is based on answer set programming (ASP) solvers. To that end, we explain how an NFA and its response to input samples can be encoded as rules in a logic program.
Wojciech Wieczorek +2 more
doaj +1 more source
Advanced Functional Materials, EarlyView.Two‐photon lithography (TPL) enables 3D magnetic nanostructures with unmatched freedom in geometry and material choice. Advances in voxel control, deposition, and functionalization open pathways to artificial spin ices, racetracks, microrobots, and a number of additional technological applications.
Joseph Askey +5 more
wiley +1 more source
Novel and Fast Image Segmentation Algorithm Based on Deterministic Finite Automaton
Yu Wang +5 more
+4 more sources
Computing the Width of Non-deterministic Automata [PDF]
Logical Methods in Computer Science, 2019 We introduce a measure called width, quantifying the amount of nondeterminism in automata. Width generalises the notion of good-for-games (GFG) automata, that correspond to NFAs of width 1, and where an accepting run can be built on-the-fly on any ...
Denis Kuperberg, Anirban Majumdar
doaj +1 more source
Advanced Functional Materials, EarlyView.Controlled laser‐drilling of embedded HfO2 membranes creates three layer nanopores with Gaussian‐shaped cavities sculptured in the supporting layers. These embedded solid‐state nanopores slow DNA translocation by 12‐fold compared to SiNx pores, enabling high‐resolution, label‐free detection of short DNAs, RNAs, and proteins.
Jostine Joby +4 more
wiley +1 more source
Electronic Proceedings in Theoretical Computer Science, 2011 The Parikh finite word automaton model (PA) was introduced and studied by Klaedtke and Ruess in 2003. Here, by means of related models, it is shown that the bounded languages recognized by PA are the same as those recognized by deterministic PA. Moreover,
Michaël Cadilhac +2 more
doaj +1 more source