Results 51 to 60 of about 51,114 (288)
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
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
Incremental construction of minimal acyclic finite-state automata [PDF]
, 2000 In this paper, we describe a new method for constructing minimal, deterministic, acyclic finite-state automata from a set of strings. Traditional methods consist of two phases: the first to construct a trie, the second one to minimize it. Our approach is
Daciuk, Jan +3 more
core +4 more sources
A Characterization of Completely Reachable Automata [PDF]
, 2018 A complete deterministic finite automaton in which every non-empty subset of the state set occurs as the image of the whole state set under the action of a suitable input word is called completely reachable.
EA Bondar, F Gonze, H Don
core +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
Anomaly Detection in Cyclic Communication in OT Protocols
Energies, 2022 This paper demonstrates the effectiveness of using anomaly detection in cyclic communication as a method aimed at protecting industrial installations from steganographic communication and a wide range of cyberattacks.
Milosz Smolarczyk +3 more
doaj +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
The \v Cerný conjecture for aperiodic automata [PDF]
Discrete Mathematics & Theoretical Computer Science, 2007 A word w is called a synchronizing (recurrent, reset, directable) word of a deterministic finite automaton (DFA) if w brings all states of the automaton to some specific state; a DFA that has a synchronizing word is said to be synchronizable.
A. N. Trahtman
doaj +1 more source