Results 171 to 180 of about 63,385 (219)
Inverse design of cellular structures with the targeted nonlinear mechanical response. [PDF]
Sci RepNakarmi S +6 more
europepmc +1 more source
Rudin-Shapiro Sums Via Automata Theory and Logic. [PDF]
Theory Comput SystRampersad N, Shallit J.
europepmc +1 more source
Sand automata as cellular automata
Theoretical Computer Science, 2009 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Alberto Dennunzio +2 more
exaly +4 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
ACM SIGLOG News, 2022
For the Automata Theory Column, we have an article by B. Srivathsan on the reachability problem in timed automata. Ever since timed automata were introduced by Alur and Dill, they have been widely used in the verification of real-time systems. Their appeal comes from a simple definition that couples expressiveness with computational tractability.
openaire +1 more source
For the Automata Theory Column, we have an article by B. Srivathsan on the reachability problem in timed automata. Ever since timed automata were introduced by Alur and Dill, they have been widely used in the verification of real-time systems. Their appeal comes from a simple definition that couples expressiveness with computational tractability.
openaire +1 more source
THE GENERALIZATION OF GENERALIZED AUTOMATA: EXPRESSION AUTOMATA
International Journal of Foundations of Computer Science, 2005We explore expression automata with respect to determinism and minimization. We define determinism of expression automata using prefix-freeness. This approach is, to some extent, similar to that of Giammarresi and Montalbano's definition of deterministic generalized automata.
Han, Yo-Sub, Wood, Derick
openaire +2 more sources
EFFICIENT AUTOMATA CONSTRUCTIONS AND APPROXIMATE AUTOMATA
International Journal of Foundations of Computer Science, 2008In this paper, we present data structures and algorithms for efficiently constructing approximate automata. An approximate automaton for a regular language L is one which accepts at leastL. Such automata can be used in a variety of practical applications, including network security pattern matching, in which false-matches are only a performance ...
Bruce W. Watson +4 more
openaire +4 more sources
Factor Automata of Automata and Applications
2007An efficient data structure for representing the full index of a set of strings is the factor automaton, the minimal deterministic automaton representing the set of all factors or substrings of these strings. This paper presents a novel analysis of the size of the factor automaton of an automaton, that is the minimal deterministic automaton accepting ...
Mehryar Mohri +2 more
openaire +1 more source
Recasting Constraint Automata into Büchi Automata
2008Constraint automata have been proposed as the operational semantics of Reo, a glue-code language for the exogenous composition and orchestration of components in a software system. In this paper we recast the theory of constraint automata into that of Buchi automata on infinite strings of records. We use records to express simultaneity constraints of I/
M.M. Bonsangue (Marcello) +1 more
openaire +2 more sources
International Journal of Foundations of Computer Science, 2016
We consider the model of deterministic set automata which are basically deterministic finite automata equipped with a set as an additional storage medium. The basic operations on the set are the insertion of elements, the removing of elements, and the test whether an element is in the set.
Martin Kutrib +2 more
openaire +1 more source
We consider the model of deterministic set automata which are basically deterministic finite automata equipped with a set as an additional storage medium. The basic operations on the set are the insertion of elements, the removing of elements, and the test whether an element is in the set.
Martin Kutrib +2 more
openaire +1 more source