Results 21 to 30 of about 14,469 (313)
History−Register Automata [PDF]
, 2013 Programs with dynamic allocation are able to create and use an unbounded number of fresh resources, such as references, objects, files, etc. We propose History-Register Automata (HRA), a new automata-theoretic formalism for modelling such programs. HRAs
Tzevelekos, Nikos +5 more
core +1 more source
Multi-Head Finite Automata: Characterizations, Concepts and Open Problems [PDF]
Electronic Proceedings in Theoretical Computer Science, 2009 Multi-head finite automata were introduced in (Rabin, 1964) and (Rosenberg, 1966). Since that time, a vast literature on computational and descriptional complexity issues on multi-head finite automata documenting the importance of these devices has been ...
Andreas Malcher +2 more
doaj +1 more source
A Formal Model for Semantic Computing Based on Generalized Probabilistic Automata
Entropy, 2019 In most previous research, “semantic computing” refers to computational implementations of semantic reasoning. It lacks support from the formal theory of computation.
Guangjian Huang +3 more
doaj +1 more source
Robust Controller Synthesis in Timed Automata [PDF]
, 2013 We consider the fundamental problem of Büchi acceptance in timed automata in a robust setting. The problem is formalised in terms of controller synthesis: timed automata are equipped with a parametrised game-based semantics that models the possible ...
Reynier, Pierre-Alain +7 more
core +1 more source
Quantum Finite Automata and Weighted Automata
J. Autom. Lang. Comb., 2007 10 pages, Preliminary version appears in the Proceedings of ACiD-2005, Texts in Algorithmics series of KCL publications, pp.
M. V. Panduranga Rao, V. Vinay
openaire +2 more sources
Efficient Multistriding of Large Non-deterministic Finite State Automata for Deep Packet Inspection [PDF]
, 2012 Multistride automata speed up input matching because each multistriding transformation halves the size of the input string, leading to a potential 2x speedup.
Sisto, Riccardo +5 more
core +1 more source
IEEE Access, 2023 Additive cellular automata over a finite abelian group are a wide class of cellular automata (CA) that are able to exhibit most of the complex behaviors of general CA and they are often exploited for designing applications in different practical contexts.
Alberto Dennunzio +2 more
doaj +1 more source
Generalized Results on Monoids as Memory [PDF]
Electronic Proceedings in Theoretical Computer Science, 2017 We show that some results from the theory of group automata and monoid automata still hold for more general classes of monoids and models. Extending previous work for finite automata over commutative groups, we demonstrate a context-free language that ...
Özlem Salehi +2 more
doaj +1 more source
On the Existence of Universal Finite or Pushdown Automata [PDF]
Electronic Proceedings in Theoretical Computer Science, 2012 We investigate the (non)-existence of universal automata for some classes of automata, such as finite automata and pushdown automata, and in particular the influence of the representation and encoding function.
Manfred Kudlek
doaj +1 more source
Efficient Equivalence Checking Technique for Some Classes of Finite-State Machines
Моделирование и анализ информационных систем, 2020 Finite transducers, two-tape automata, and biautomata are related computational models descended from the concept of Finite-State Automaton. In these models an automaton controls two heads that read or write symbols on the tapes in the one-way mode.
Vladimir A. Zakharov
doaj +1 more source