Results 11 to 20 of about 17,250 (168)
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
Coalgebraic Automata Theory: Basic Results [PDF]
Logical Methods in Computer Science, 2008 We generalize some of the central results in automata theory to the abstraction level of coalgebras and thus lay out the foundations of a universal theory of automata operating on infinite objects. Let F be any set functor that preserves weak pullbacks.
C. Kupke, Y. Venema
doaj +1 more source
Algorithms for Converting Finite Automata Corresponding to Infinite Iterative Trees
Современные информационные технологии и IT-образование, 2021 In this paper, we work with some different variants of finite automata, each of which corresponds to an infinite iterative tree constructed for some given morphism.
Mikhail Abramyan, Boris Melnikov
doaj +1 more source
A Program Study of the Union of Semilattices on a Set of Subsets of Grids of the Waterloo Language
Современные информационные технологии и IT-образование, 2023 Relevance. The relevance of the subject area under consideration is due to the need to study the set of regular languages, in particular to describe their various sub-classes. Also relevant are the tasks that may arise in some such subclasses.
Mikhail Abramyan, Boris Melnikov
doaj +1 more source
Nondeterministic State Complexity of Positional Addition [PDF]
Electronic Proceedings in Theoretical Computer Science, 2009 Consider nondeterministic finite automata recognizing base-k positional notation of numbers. Assume that numbers are read starting from their least significant digits.
Galina Jirásková, Alexander Okhotin
doaj +1 more source
Nondeterministic State Complexity for Suffix-Free Regular Languages [PDF]
Electronic Proceedings in Theoretical Computer Science, 2010 We investigate the nondeterministic state complexity of basic operations for suffix-free regular languages. The nondeterministic state complexity of an operation is the number of states that are necessary and sufficient in the worst-case for a minimal ...
Yo-Sub Han, Kai Salomaa
doaj +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
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
From Finite-Valued Nondeterministic Transducers to Deterministic Two-Tape Automata
Logic in Computer Science, 2021 The question whether P equals NP revolves around the discrepancy between active production and mere verification by Turing machines. In this paper, we examine the analogous problem for finite transducers and automata.
E. Burjons, F. Frei, Martin Raszyk
semanticscholar +1 more source
Alternating, private alternating, and quantum alternating realtime automata [PDF]
Logical Methods in Computer Science, 2019 We present new results on realtime alternating, private alternating, and quantum alternating automaton models. Firstly, we show that the emptiness problem for alternating one-counter automata on unary alphabets is undecidable.
Gökalp Demirci +4 more
doaj +1 more source