Results 1 to 10 of about 44,777 (358)
LNCS 4783 (2007), pp 180-191, 2014 We study the pattern matching automaton introduced in (A unifying framework for seed sensitivity and its application to subset seeds) for the purpose of seed-based similarity search. We show that our definition provides a compact automaton, much smaller than the one obtained by applying the Aho-Corasick construction.
Gregory Kucherov +2 more
arxiv +8 more sources
On the Structure Theory of Partial Automaton Semigroups [PDF]
Semigroup Forum (2020), 2018 We study automaton structures, i.e. groups, monoids and semigroups generated by an automaton, which, in this context, means a deterministic finite-state letter-to-letter transducer. Instead of considering only complete automata, we specifically investigate semigroups generated by partial automata.
D. D’Angeli +2 more
arxiv +3 more sources
On the Complexity of the Word Problem for Automaton Semigroups and Automaton Groups [PDF]
Advances in Applied Mathematics, Volume 90, September 2017, Pages
160-187, ISSN 0196-8858, 2016 In this paper, we study the word problem for automaton semigroups and automaton groups from a complexity point of view. As an intermediate concept between automaton semigroups and automaton groups, we introduce automaton-inverse semigroups, which are generated by partial, yet invertible automata. We show that there is an automaton-inverse semigroup and,
Daniele D'Angeli +2 more
arxiv +6 more sources
Self-Automaton Semigroups [PDF]
Semigroup Forum, 2014 After reviewing automaton semigroups, we introduce Cayley Automata and the corresponding Cayley Automaton semigroups. We investigate which semigroups are isomorphic to their Cayley Automaton semigroup and give some results for special classes of semigroups. We answer a question posed by Cain relating to the dual construction.
arxiv +6 more sources
K-Position, Follow, Equation and K-C-Continuation Tree Automata Constructions [PDF]
Electronic Proceedings in Theoretical Computer Science, 2014 There exist several methods of computing an automaton recognizing the language denoted by a given regular expression: In the case of words, the position automaton P due to Glushkov, the c-continuation automaton C due to Champarnaud and Ziadi, the follow ...
Ludovic Mignot +2 more
doaj +2 more sources
A Self-Modifying Cellular Automaton Model of Historical Urbanization in the San Francisco Bay Area [PDF]
, 1997 K. Clarke, Stacy Hoppen, L. Gaydos
semanticscholar +2 more sources
Authentic Humans or Automatons?
AJN, American Journal of Nursing, 1967 BARBARA C. SCIHTTT
openalex +4 more sources
Measurement-induced phase transitions in quantum automaton circuits [PDF]
Physical review B, 2020 We study the entanglement dynamics in a generic quantum automaton circuit subjected to projective measurements. We design an efficient algorithm which not only allows us to perform large scale simulation for the R\'enyi entropy but also provides a ...
J. Iaconis, A. Lucas, Xiao Chen
semanticscholar +1 more source
Elementary definability of the class of universal hypergraphic automata in the class of semigroups [PDF]
Известия Саратовского университета. Новая серия. Серия Математика. Механика. Информатика, 2022 Hypergraphic automata are automata, state sets and output symbol sets of which are hypergraphs, being invariant under actions of transition and output functions. Universally attracting objects in the category of hypergraphic automata are called universal
Molchanov, Vladimir Aleksandrovich +1 more
doaj +1 more source