Results 31 to 40 of about 17,250 (168)
Reachability in Higher-Order-Counters
, 2013 Higher-order counter automata (\HOCS) can be either seen as a restriction of higher-order pushdown automata (\HOPS) to a unary stack alphabet, or as an extension of counter automata to higher levels.
A. Bouajjani +11 more
core +1 more source
One-Tape Turing Machine Variants and Language Recognition
, 2015 We present two restricted versions of one-tape Turing machines. Both characterize the class of context-free languages. In the first version, proposed by Hibbard in 1967 and called limited automata, each tape cell can be rewritten only in the first $d ...
Pighizzini, Giovanni
core +1 more source
A Tighter Bound for the Determinization of Visibly Pushdown Automata
, 2009 Visibly pushdown automata (VPA), introduced by Alur and Madhusuan in 2004, is a subclass of pushdown automata whose stack behavior is completely determined by the input symbol according to a fixed partition of the input alphabet.
Van Tang, Nguyen
core +2 more sources
Experiments on Parallel Composition of Timed Finite State Machines
Труды Института системного программирования РАН, 2018 In this paper, we continue our work that is devoted to the parallel composition of Timed Finite State Machines (TFSMs). We consider the composition of TFSMs with timeouts and output delays.
A. P. Sotnikov +2 more
doaj +1 more source
Efficient Algorithms for Computing the Inner Edit Distance of a Regular Language via Transducers
Algorithms, 2018 The concept of edit distance and its variants has applications in many areas such as computational linguistics, bioinformatics, and synchronization error detection in data communications.
Lila Kari +3 more
doaj +1 more source
Multipass automata and group word problems
, 2014 We introduce the notion of multipass automata as a generalization of pushdown automata and study the classes of languages accepted by such machines. The class of languages accepted by deterministic multipass automata is exactly the Boolean closure of the
Ceccherini-Silberstein, Tullio +4 more
core +3 more sources
On the use of observation equivalence in synthesis abstraction [PDF]
, 2011 In a previous paper we introduced the notion of synthesis abstraction, which allows efficient compositional synthesis of maximally permissive supervisors for large-scale systems of composed finite-state automata.
Fabian, Martin +3 more
core +2 more sources
Two-Way Automata Making Choices Only at the Endmarkers
, 2011 The question of the state-size cost for simulation of two-way nondeterministic automata (2NFAs) by two-way deterministic automata (2DFAs) was raised in 1978 and, despite many attempts, it is still open.
Geffert, Viliam +2 more
core +1 more source
Time‐ and Behaviour‐Preserving Execution of Determinate Supervisory Control
IET Cyber-Physical Systems: Theory &Applications, Volume 11, Issue 1, January/December 2026.The activity framework is a model‐based framework incorporating a model of activities with determinate timing and behaviour, and a strong mathematical foundation based on max‐plus algebra that allows efficient timing analysis and optimisation of CPS. Preserving the specified behaviour and the model‐predicted timing in an implementation is challenging ...
Alireza Mohamadkhani +3 more
wiley +1 more source
Energy‐Efficient Knapsack Optimization Using Probabilistic Memristor Crossbars
Advanced Intelligent Systems, Volume 7, Issue 12, December 2025.The knapsack problem, a nondeterministic polynomial‐time (NP)‐hard combinatorial optimization problem, is solved energy‐efficiently. This work presents an algorithm‐hardware co‐design and implementation for practical (non‐ideal) NP‐hard problems with destabilizing self‐feedback (non‐zero diagonal) and non‐binary Hamiltonian representations under analog
Jinzhan Li, Suhas Kumar, Su‐in Yi
wiley +1 more source