A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Filters
Weak Cost Register Automata are Still Powerful
[article]
2018
arXiv
pre-print
Preserved Fulltext
We consider one of the weakest variants of cost register automata over a tropical semiring, namely copyless cost register automata over N with updates using and increments. ...
To emphasize how weak these machines are, we also show that they can be expressed as a restricted form of linearly-ambiguous weighted automata. ...
Conclusion Deceptively powerful, copyless cost register automata with increments and min operations were shown to be able to simulate and check runs of counter machines. ...
arXiv:1804.06336v1
fatcat:kuxxb6cokbgllitrwm6acbwham
Machine Learning for Dynamic Software Analysis: Potentials and Limits (Dagstuhl Seminar 16172)
2016
Dagstuhl Reports
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
The main frontier is about what kind of extended state machine models could we learn, more powerful than register automata. ...
We reckon that register automata are still too limited, we need richer models. At the same time, it is important to be able to identify relevant abstractions from data. ...
doi:10.4230/dagrep.6.4.161
dblp:journals/dagstuhl-reports/BennaceurGHM16
fatcat:7t3jl5y7dfanfjeev3k42nmfau
On the Way to Alternating Weak Automata
2018
Foundations of Software Technology and Theoretical Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
Universal co-Büchi tree automata, a special case of alternating parity tree automata, can be exponentially more concise than alternating weak automata. ...
We show that: Alternating parity word automata can be turned into alternating weak automata of quasipolynomial (rather than exponential) size. ...
In stark contrast, our lower bound for transformations to weak tree automata shows that on trees the simplicity of the weak acceptance condition comes at a much higher cost. ...
doi:10.4230/lipics.fsttcs.2018.21
dblp:conf/fsttcs/BokerL18
fatcat:v2bviizkqfcbtj7chq5j6ey7de
LAYERED CELLULAR AUTOMATA FOR PSEUDORANDOM NUMBER GENERATION
2007
International Journal of Modern Physics C
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
The proposed Layered Cellular Automata (L-LCA), which comprises of a main CA with L additional layers of memory registers, has simple local interconnections and high operating speed. ...
Index Termscellular automata, programmable cellular automata, pseudorandom number generation. ...
With 16-and 32-bit main CA, 3-LCA and 4-LCA results are still relatively weak although the results are slightly improved with increased layers of memory. ...
doi:10.1142/s0129183107010413
fatcat:vf3laa2dcncczl3erzbdex4uby
Efficient Design and Evaluation of Countermeasures against Fault Attacks Using Formal Verification
[chapter]
2016
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Based on insights gathered from this evaluation, we analyze any remaining weaknesses and propose applications of these countermeasures that are more robust. ...
By modeling reference assembly code and its protected variant as automata, the framework can generate a set of equations for an SMT solver, the solutions of which represent possible attack paths. ...
it, and comparing it to the register still holding the value that was stored. ...
doi:10.1007/978-3-319-31271-2_11
fatcat:fy4ebwizwjgbnhjmbdntelup54
Regular Expressions for Data Words
[chapter]
2012
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
We also study the complexity of the standard decision problems for REM, which turn out to be the same as for register automata. ...
We first define regular expression with memory (REM), which extend standard regular expressions with limited memory and show that they capture the class of data words defined by register automata. ...
This shows that no weak register automaton can recognize the language L. To complete the proof we still have to show the following: Lemma 6.4. ...
doi:10.1007/978-3-642-28717-6_22
fatcat:rfuxmrqyobcmnld33hxxq5bi5q
A Generalised Twinning Property for Minimisation of Cost Register Automata
2016
Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science - LICS '16
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Unambiguous WA over a monoid (M, ⊗) can equivalently be described by cost register automata whose registers take their values in M , and are updated by operations of the form x := y ⊗ c, with c ∈ M . ...
Recently, cost register automata (CRA) have been introduced as an alternative model to describe any function realised by a WA by means of a deterministic machine. ...
Our objective is to identify the register complexity for cost register automata in the class CRA⊗c(S). ...
doi:10.1145/2933575.2934549
dblp:conf/lics/DaviaudRT16
fatcat:h5mpy4lpzzabdjugoiz45l4v3m
Regular expressions for data words
2015
Journal of computer and system sciences (Print)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2016; you can also visit the original URL.
The file type is application/pdf.
We also study the complexity of the standard decision problems for REM, which turn out to be the same as for register automata. ...
We first define regular expression with memory (REM), which extend standard regular expressions with limited memory and show that they capture the class of data words defined by register automata. ...
This shows that no weak register automaton can recognize the language L. To complete the proof we still have to show the following: Lemma 6.4. ...
doi:10.1016/j.jcss.2015.03.005
fatcat:67x5eqowtjhpvf32iyghg6fi4u
On the Importance of Having an Identity or, is Consensus really Universal?
[article]
2002
arXiv
pre-print
Preserved Fulltext
The Internet Archive has a preservation copy of this work in our general collections.
The file type is application/pdf.
Other Versions
If processes are identical, deterministic i/o automata without identifiers then naming is impossible, even if memory is asymmetric and the adversary is weak. ...
Then, if processes are identical, deterministic i/o automata without identifiers, naming is impossible, even if memory is asymmetric and the adversary is weak. ...
arXiv:cs/0201006v2
fatcat:gks5m2qvpnd6hpxtlesqfulqw4
In the Maze of Data Languages
[article]
2012
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Extensions of automata and logics over finite alphabets have been defined to recognize data languages, both in the string and tree cases. ...
In this paper we describe and compare the complexity and expressiveness of such models to understand which ones are better candidates as regular models. ...
Register automata are finite automata equipped with a finite set of registers that can hold data values which can be tested for equality. ...
arXiv:1208.5980v1
fatcat:zur4mgkwqbep5a3nfkieh5vzvu
Algorithms for Inferring Register Automata
[chapter]
2014
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
In recent years, two different approaches for learning register automata have been developed: as part of the LearnLib tool algorithms have been implemented that are based on the Nerode congruence for register ...
automata, whereas the Tomte tool implements algorithms that use counterexample-guided abstraction refinement to automatically construct appropriate mappers. ...
Also, the introduction of SDTs and abstract suffixes has proven to be a powerful conceptual framework that scales beyond simple register automata. ...
doi:10.1007/978-3-662-45234-9_15
fatcat:p5hlhykxwncgnojv7y3u64sx7a
Stackless Processing of Streamed Trees
2021
Proceedings of the 40th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
In particular, we confirm the conjectured characterization of tree languages defined by DTDs that are recognizable without registers, by Segoufin and Vianu (2002), in the special case of tree languages ...
We propose an intermediate stackless model based on register automata equipped with a single counter, used to maintain the current depth in the tree. ...
copies we are still on the cycle, of course. ...
doi:10.1145/3452021.3458320
fatcat:y7kerdlnu5gzhilbdxfeuam55i
Zulu: An Interactive Learning Competition
[chapter]
2010
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2012; you can also visit the original URL.
The file type is application/pdf.
finite automata from membership queries. ...
Active language learning is an interesting task for which theoretical results are known and several applications exist. ...
Acknowledgement Zulu makes use of many pieces from the Gowachin engine developed by François Coste. ...
doi:10.1007/978-3-642-14684-8_15
fatcat:izctpjmvjvaknnkjbphygnuqhu
Extended Models of Finite Automata
[article]
2019
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
We examine the effect of various parameters on the language recognition power. We establish a link between the decision problems of matrix semigroups and the corresponding automata. ...
We investigate the language recognition power of finite automata over integer and rational matrix groups and reveal new relationships between the language classes corresponding to these models. ...
Equivalence of Finite and Pushdown Automata with Valences In this section, we are going to prove that valence pushdown automata are only as powerful as valence automata. ...
arXiv:1912.11699v1
fatcat:umb4afgbhzatratlrleuvnrmmm
Querying Graphs with Data
2016
Journal of the ACM
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
From the complexity point of view, the right type of formalisms are subclasses of register automata. These, however, are not well suited for querying. ...
To overcome this, we develop several types of extended regular expressions to specify paths with data, and study their querying power and complexity. ...
In the following sections we show that we can achieve good query answering complexity using register automata and some of their restrictions, while still retaining sufficient expressive power. ...
doi:10.1145/2850413
fatcat:zqmfw3n33ndejl523kpntfcobu
« Previous
Showing results 1 — 15 out of 2,168 results