Results 41 to 50 of about 51,114 (288)
Random Deterministic Automata With One Added Transition [PDF]
Logical Methods in Computer ScienceEvery language recognized by a non-deterministic finite automaton can be recognized by a deterministic automaton, at the cost of a potential increase of the number of states, which in the worst case can go from $n$ states to $2^n$ states. In this article,
Arnaud Carayol +3 more
doaj +1 more source
Higher-Order Pushdown Systems with Data [PDF]
Electronic Proceedings in Theoretical Computer Science, 2012 We propose a new extension of higher-order pushdown automata, which allows to use an infinite alphabet. The new automata recognize languages of data words (instead of normal words), which beside each its letter from a finite alphabet have a data value ...
Paweł Parys
doaj +1 more source
Fuzzy !-automata and its relationships [PDF]
, 2015 A notion of finite ! - automata with single initial state is proposed. The concept of fuzzy deterministic Buchi automaton and Muller automaton with full acceptance component which is recognize the same fuzzy language are studied. We also establish the
Cokilavany, R. +2 more
core +1 more source
Algorithm Design for Deterministic Finite Automata for a Given Regular Language with Prefix Strings
SCRS Conference Proceedings on Intelligent Systems, 2021 The field of automata theory is one of the most important areas in the field of Computer Science and Engineering that deals with how efficiently a problem can be solved on a model of computation using an algorithm.
Rashandeep Singh, G. Goyal
semanticscholar +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
Fundamental Cycle of a Periodic Box-Ball System [PDF]
, 2002 We investigate a soliton cellular automaton (Box-Ball system) with periodic boundary conditions. Since the cellular automaton is a deterministic dynamical system that takes only a finite number of states, it will exhibit periodic motion. We determine its
Daisuke Yoshihara +12 more
core +1 more source
The Magic Number Problem for Subregular Language Families [PDF]
Electronic Proceedings in Theoretical Computer Science, 2010 We investigate the magic number problem, that is, the question whether there exists a minimal n-state nondeterministic finite automaton (NFA) whose equivalent minimal deterministic finite automaton (DFA) has alpha states, for all n and alpha satisfying n
Markus Holzer +2 more
doaj +1 more source
Complexity of checking whether two automata are synchronized by the same language [PDF]
, 2014 A deterministic finite automaton is said to be synchronizing if it has a reset word, i.e. a word that brings all states of the automaton to a particular one. We prove that it is a PSPACE-complete problem to check whether the language of reset words for a
D. Eppstein +10 more
core +1 more source
Descriptional Complexity of Non-Unary Self-Verifying Symmetric Difference Automata [PDF]
Electronic Proceedings in Theoretical Computer Science, 2017 Previously, self-verifying symmetric difference automata were defined and a tight bound of 2^n-1-1 was shown for state complexity in the unary case. We now consider the non-unary case and show that, for every n at least 2, there is a regular language L_n
Laurette Marais, Lynette van Zijl
doaj +1 more source
Non-returning deterministic and nondeterministic finite automata with translucent letters
RAIRO - Theoretical Informatics and Applications, 2023 Here, we propose a variant of the nondeterministic finite automaton with translucent letters (NFAwtl), which, after reading and deleting a letter, does not return to the left end of its tape, but instead continues from the position of the letter just ...
F. Mráz, F. Otto
semanticscholar +1 more source