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.
Filters
The Language, the Expression, and the (Small) Automaton
[chapter]
2006
Lecture Notes in Computer Science
Preserved Fulltext
This survey paper reviews the means that allow to go from one representation of the languages to the other and how, and to what extend, one can keep them small. ...
Some emphasis is put on the comparison between the expressions that can be computed from a given automaton and on the construction of the derived term automaton of an expression. ...
In this talk, mostly a survey, I review the means that allow to go from one representation of the languages to the other and how, and to what extend, one can keep them small. ...
doi:10.1007/11605157_2
fatcat:2seuxjlgbjdyfcpdxjxrj6ay6a
A small 1-way quantum finite automaton
[article]
1998
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.
We construct a 1-way QFAs that are quadratically smaller than any equivalent deterministic finite automata and give the correct answer with a large probability by recognizing the languages in a two letter ...
alphabet "the number of the letters a and the number of the letters b are divisible by n". ...
Ambainis and Freivalds [1] consider the language L p = {a i |i is divisible by p}. Any 1-way finite automaton recognizing L p has at least p states. ...
arXiv:quant-ph/9810065v1
fatcat:gkaulyggpngklbjtui7dlmnr2u
Monadic datalog and the expressive power of languages for web information extraction
2002
Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems - PODS '02
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 2010; you can also visit the original URL.
The file type is application/pdf.
We believe that MSO has the right expressiveness required for Web information extraction and propose MSO as a yardstick for evaluating and comparing wrappers. ...
Along the way, several other results on the complexity of query evaluation and query containment for monadic datalog over trees are established, and a simple normal form for this language is presented. ...
The results first announced in [Gottlob and Koch 2002a ] include a formal comparison of monadic datalog and Elog with other visual wrapping languages that have been proposed in the literature. ...
doi:10.1145/543613.543617
dblp:conf/pods/GottlobK02
fatcat:ao6t3msqc5ettmqjimucwbb6tu
Monadic datalog and the expressive power of languages for web information extraction
2002
Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems - PODS '02
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 2010; you can also visit the original URL.
The file type is application/pdf.
We believe that MSO has the right expressiveness required for Web information extraction and propose MSO as a yardstick for evaluating and comparing wrappers. ...
Along the way, several other results on the complexity of query evaluation and query containment for monadic datalog over trees are established, and a simple normal form for this language is presented. ...
The results first announced in [Gottlob and Koch 2002a ] include a formal comparison of monadic datalog and Elog with other visual wrapping languages that have been proposed in the literature. ...
doi:10.1145/543616.543617
fatcat:yti6oaakbbepbdwde7o6zwe37q
Monadic datalog and the expressive power of languages for Web information extraction
2004
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 2010; you can also visit the original URL.
The file type is application/pdf.
We believe that MSO has the right expressiveness required for Web information extraction and propose MSO as a yardstick for evaluating and comparing wrappers. ...
Along the way, several other results on the complexity of query evaluation and query containment for monadic datalog over trees are established, and a simple normal form for this language is presented. ...
The results first announced in [Gottlob and Koch 2002a ] include a formal comparison of monadic datalog and Elog with other visual wrapping languages that have been proposed in the literature. ...
doi:10.1145/962446.962450
fatcat:owts3nh3bnfx5kevtrltanshsq
Mean-Payoff Automaton Expressions
[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 2011; you can also visit the original URL.
The file type is application/pdf.
Other Versions
We also present for the first time an algorithm to compute distance between two quantitative languages, and in our case the quantitative languages are given as mean-payoff automaton expressions. ...
We introduce a new class of quantitative languages, defined by mean-payoff automaton expressions, which is robust and decidable: it is closed under the four pointwise operations, and we show that all decision ...
Conclusion and Future Works We have presented a new class of quantitative languages, the mean-payoff automaton expressions which are both robust and decidable (see Table 1 ), and for which the distance ...
doi:10.1007/978-3-642-15375-4_19
fatcat:ge4t3qr2yvbghgwlzhfbqvcs2q
Automaton segmentation
2007
Proceedings of the 14th ACM conference on Computer and communications security - CCS '07
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 2009; you can also visit the original URL.
The file type is application/pdf.
We present the automaton segmentation approach, analyze privacy preservation in details, and finally examine the end-to-end performance and scalability through experiments and analysis. ...
Through an innovative automaton segmentation scheme, distributed access control enforcement, and query segment encryption, our system integrates security enforcement and query forwarding while preserving ...
The anonymous reviewers provided valuable feedback that helped improve the paper's quality. This research was supported in part by NSF CCR-0233324 and NSF/DHS 0335241. ...
doi:10.1145/1315245.1315308
dblp:conf/ccs/LiLLLC07
fatcat:xoa5cwjyifdirjvx7whdascilu
The Speaking Automaton
1846
Scientific American
Preserved Fulltext
The Internet Archive has a preservation copy of this work in our general collections.
An English paper speaking of the automaton says; "The Automaton can plainly, at the will of the casual spectator, speak any sentence or words, in any langu:l.ge, sing, whisper, laugh, &c. ; the organs ...
The cloud went off the pilgrim's brow, As a small and meagre book, Uncha8ed with gold or diamond gem, From his folding robe he took; "Here, lady, is the pearl of price May it prove ai much to thee . ...
doi:10.1038/scientificamerican12191846-98e
fatcat:dguwdmqhn5cnhbyndwux3dpvlm
Automaton semigroups
2009
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 2017; you can also visit the original URL.
The file type is application/pdf.
The concept of an automaton group generalizes easily to semigroups, and the systematic study of this area is beginning. This paper aims to contribute to that study. ...
The basic theory of automaton semigroups is briefly reviewed. Various natural semigroups are shown to arise as automaton semigroups. ...
The author also thanks the two anonymous referees, whose comments greatly improved the paper. ...
doi:10.1016/j.tcs.2009.07.054
fatcat:4yde4q63wjbjnf4kwum35sn7wy
XML-document-filtering automaton
2008
Proceedings of the VLDB Endowment
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.
In a publish-subscribe system based on filtering of XML documents subscribers specify their interests with profiles expressed in the XPath language. ...
We assume that the XML documents all conform to a given DTD; our algorithm utilizes the DTD in the preprocessing phase of the automaton to prune out descendant axes (//) and wildcards ( * ) from the XPath ...
When the SAX parser encounters a start element tag, the current state of the automaton is pushed onto a stack, and the symbol corresponding to the element name is consumed by the automaton. ...
doi:10.14778/1454159.1454245
fatcat:mdpwvhn3cjhova2xd7svup7qvm
Learning Stochastic Logical Automaton
[chapter]
2006
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 2007; you can also visit the original URL.
The file type is application/pdf.
The probability distributions over the state transitions and actions are estimated using the EM algorithm. ...
The algorithms combine logic and probabilistic models through inductive generalisation. The inductive generalisation algorithms consist of three parts. ...
The first author would like to thank Katsumi Inoue for his advice in this research. ...
doi:10.1007/11780496_23
fatcat:35gqmdwgvzc7jdbm7csidwsoam
Man as an Automaton
1875
Scientific American
Preserved Fulltext
The Internet Archive has a preservation copy of this work in our general collections.
As that system of shortband which has the few est strokes consistent with legibility receives the preference, so that language which uses the fewest and shortest words to express an idea perspicuously ...
deserves to become the uni versal language of the commercial world. ...
doi:10.1038/scientificamerican11201875-321a
fatcat:6ftwywei4zai3pmlkdin5kut6m
Parikh's theorem: A simple and direct automaton construction
2011
Information Processing Letters
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.
Other Versions
Parikh's theorem states that the Parikh image of a context-free language is semilinear or, equivalently, that every context-free language has the same Parikh image as some regular language. ...
We present a very simple construction that, given a context-free grammar, produces a finite automaton recognizing such a regular language. ...
Acknowledgements We thank two anonymous referees and Anca Muscholl for very useful suggestions. ...
doi:10.1016/j.ipl.2011.03.019
fatcat:oxx2yoogmbefrhvqbxt2khunta
Efficient Construction of the Equation Automaton
2021
Algorithms
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.
Allauzen and Mohri have presented a unified construction of small automata and gave a construction of the equation automaton with time and space complexity in O(mlogm+m2), where m denotes the number of ...
This paper describes a fast algorithm for constructing directly the equation automaton from the well-known Thompson automaton associated with a regular expression. ...
Their comments were invaluable in depth and detail, and the current version owes much to their efforts.
Conflicts of Interest: The authors declare no conflict of interest. Algorithms 2021, 14, 238 ...
doi:10.3390/a14080238
fatcat:iurekoyovvb2dhc3eaxzyffm74
FACTORIZATIONS AND UNIVERSAL AUTOMATON OF OMEGA LANGUAGES
2014
International Journal of Foundations of 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 prove that, for every ω-rational language, this Büchi automaton, based on factorization, is canonical and that it is the smallest automaton that contains the morphic image of every equivalent Büchi ...
In this paper, we extend the concept of factorization on finite words to ω-rational languages and show how to compute them. ...
Moreover, since every automaton has a morphic image in the universal automaton, it can be a tool for the construction of automata with a small number of states. ...
doi:10.1142/s0129054114400279
fatcat:g37glxigbrcrffzzfa5nnz5ffe
« Previous
Showing results 1 — 15 out of 21,022 results