Results 101 to 110 of about 48,609 (342)

In the Maze of Data Languages [PDF]

, 2012
In data languages the positions of strings and trees carry a label from a finite alphabet and a data value from an infinite alphabet. Extensions of automata and logics over finite alphabets have been defined to recognize data languages, both in the ...
D'Antoni, Loris
core  

On Measuring Non-Recursive Trade-Offs

, 2009
We investigate the phenomenon of non-recursive trade-offs between descriptional systems in an abstract fashion. We aim at categorizing non-recursive trade-offs by bounds on their growth rate, and show how to deduce such bounds in general.
A. Malcher, A. Malcher, A. R. Meyer, A. V. Aho, B. Sunckel, Bianca Truthe, C. Kapoutsis, Ch. Herzog, D. F. Cudia, E. Dahlhaus, E. M. Schmidt, G. Buntrock, G. Higman, G. Rozenberg, Giovanni Pighizzini, H. Gruber, H. Rogers, Hermann Gruber, I. Borchardt, J. E. Hopcroft, J. Goldstine, J. Hartmanis, J. Hartmanis, Jürgen Dassow, L. G. Valiant, L. H. Haines, M. Kutrib, M. Kutrib, Markus Holzer, Martin Kutrib   +29 more
core   +4 more sources

Systematic Benchmarking of a Noise‐Tolerant Conductive Hydrogel Electrode for Epidermal Bioelectronics

Advanced Science, EarlyView.
General schematic of the approach. Abstract Conventional Silver/Silver Chloride (Ag/AgCl) electrodes remain the clinical standard for electrophysiological monitoring but are hindered by poor skin conformity, mechanical rigidity, and signal degradation, particularly under motion or sweat.
Nazmi Alsaafeen, Ioannis Ziogas, Shirina Alsaedi, Mouza Alshehhi, Shahd Almheiri, Adil Rehman, Khulood Al Shehhi, Hani Saleh, Ahsan Khandoker, Charalampos Pitsalidis, Antoun Khawaja, Anna‐Maria Pappa   +11 more
wiley   +1 more source

Deterministic pushdown automata can compress some normal sequences [PDF]

Logical Methods in Computer Science
In this paper, we give a deterministic pushdown transducer and a normal sequence of digits compressed by it. This solves positively a question left open in a previous paper by V. Becher, P. A. Heiber and the first author.
Olivier Carton, Sylvain Perifel
doaj   +1 more source

Decompositions of Grammar Constraints [PDF]

, 2008
A wide range of constraints can be compactly specified using automata or formal languages. In a sequence of recent papers, we have shown that an effective means to reason with such specifications is to decompose them into primitive constraints.
Quimper, Claude-Guy, Walsh, Toby
core   +1 more source

A Perspective on Interactive Theorem Provers in Physics

Advanced Science, EarlyView.
Into an interactive theorem provers (ITPs), one can write mathematical definitions, theorems and proofs, and the correctness of those results is automatically checked. This perspective goes over the best usage of ITPs within physics and motivates the open‐source community run project PhysLean, the aim of which is to be a library for digitalized physics
Joseph Tooby‐Smith
wiley   +1 more source

All about unambiguous polynomial closure [PDF]

TheoretiCS
We study a standard operator on classes of languages: unambiguous polynomial closure. We prove that for every class C of regular languages satisfying mild properties, the membership problem for its unambiguous polynomial closure UPol(C) reduces to the ...
Thomas Place, Marc Zeitoun
doaj   +1 more source

One-Tape Turing Machine Variants and Language Recognition

, 2015
We present two restricted versions of one-tape Turing machines. Both characterize the class of context-free languages. In the first version, proposed by Hibbard in 1967 and called limited automata, each tape cell can be rewritten only in the first $d ...
Pighizzini, Giovanni
core   +1 more source

Data‐Driven Feedback Identifies Focused Ultrasound Exposure Regimens for Improved Nanotheranostic Targeting of the Brain

Advanced Science, EarlyView.
ABSTRACT The blood‐brain barrier (BBB) renders the delivery of nanomedicine in the brain ineffective and the detection of circulating disease‐related DNA from the brain unreliable. Here, we demonstrate that microbubble‐enhanced focused ultrasound (MB‐FUS) mediated BBB opening, supported by large‐data models predict sonication regimens for safe and ...
Hohyun Lee, Victor Menezes, Shiqin Zeng, Chulyong Kim, Cynthia M. Baseman, Jae Hyun Kim, Samhita Padmanabhan, Pranav Premdas, Naima Djeddar, Anton Bryksin, Nikhil Pandey, Pavlos Anastasiadis, Anthony J. Kim, Tobey J. MacDonald, Chetan Bettegowda, Graeme F. Woodworth, Felix J. Herrmann, Costas Arvanitis   +17 more
wiley   +1 more source

Simulations for Event-Clock Automata [PDF]

Logical Methods in Computer Science
Event-clock automata (ECA) are a well-known semantic subclass of timed automata (TA) which enjoy admirable theoretical properties, e.g., determinizability, and are practically useful to capture timed specifications.
S Akshay, Paul Gastin, R Govind, B Srivathsan   +3 more
doaj   +1 more source