Results 31 to 40 of about 1,535,797 (279)
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
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
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
Electronic Proceedings in Theoretical Computer Science, 2011 The Parikh finite word automaton model (PA) was introduced and studied by Klaedtke and Ruess in 2003. Here, by means of related models, it is shown that the bounded languages recognized by PA are the same as those recognized by deterministic PA. Moreover,
Michaël Cadilhac +2 more
doaj +1 more source
Hyper-Minimization for Deterministic Weighted Tree Automata [PDF]
Electronic Proceedings in Theoretical Computer Science, 2014 Hyper-minimization is a state reduction technique that allows a finite change in the semantics. The theory for hyper-minimization of deterministic weighted tree automata is provided.
Andreas Maletti, Daniel Quernheim
doaj +1 more source
Efficient Construction of the Equation Automaton
Algorithms, 2021 This paper describes a fast algorithm for constructing directly the equation automaton from the well-known Thompson automaton associated with a regular expression.
Faissal Ouardi +2 more
doaj +1 more source
Automatic sequences: from rational bases to trees [PDF]
Discrete Mathematics & Theoretical Computer Science, 2022 The $n$th term of an automatic sequence is the output of a deterministic finite automaton fed with the representation of $n$ in a suitable numeration system.
Michel Rigo, Manon Stipulanti
doaj +1 more source
A deterministic finite state automaton for the Oriya negative verbal forms [PDF]
Language Engineering Conference, 2002. Proceedings, 2003 This paper discusses the processing of negative verbal forms in Oriya in a deterministic finite state automaton. A morphologically agglutinative language like Oriya has 'phrasal' or 'constituent' negation, where tense and aspect etc. impose restrictions on NEG marking.
openaire +2 more sources
One Drop of Non-Determinism in a Random Deterministic Automaton [PDF]
, 2023 Every 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ⁿ states.
Nicaud, Cyril +3 more
core +1 more source
Answer Set Programming for Regular Inference
Applied Sciences, 2020 We propose an approach to non-deterministic finite automaton (NFA) inductive synthesis that is based on answer set programming (ASP) solvers. To that end, we explain how an NFA and its response to input samples can be encoded as rules in a logic program.
Wojciech Wieczorek +2 more
doaj +1 more source