Results 1 to 10 of about 14,469 (313)
Neutrosophic General Finite Automata [PDF]
Neutrosophic Sets and Systems, 2019 The constructions of finite switchboard state automata is known to be an extension of finite automata in the view of commutative and switching automata.
J. Kavikumar +5 more
doaj +2 more sources
Problems on Finite Automata and the Exponential Time Hypothesis
Algorithms, 2017 We study several classical decision problems on finite automata under the (Strong) Exponential Time Hypothesis. We focus on three types of problems: universality, equivalence, and emptiness of intersection.
Henning Fernau, Andreas Krebs
doaj +3 more sources
A Nivat Theorem for Weighted Alternating Automata over Commutative Semirings [PDF]
Logical Methods in Computer Science, 2023 This paper connects the classes of weighted alternating finite automata (WAFA), weighted finite tree automata (WFTA), and polynomial automata (PA). First, we investigate the use of trees in the run semantics for weighted alternating automata and prove ...
Gustav Grabolle
doaj +1 more source
On the Derivational Entropy of Left-to-Right Probabilistic Finite-State Automata and Hidden Markov Models [PDF]
Computational Linguistics, 2017 Probabilistic finite-state automata are a formalism that is widely used in many problems of automatic speech recognition and natural language processing.
Joan Andreu Sánchez +3 more
doaj +2 more sources
Exact Affine Counter Automata [PDF]
Electronic Proceedings in Theoretical Computer Science, 2017 We introduce an affine generalization of counter automata, and analyze their ability as well as affine finite automata. Our contributions are as follows.
Masaki Nakanishi +4 more
doaj +1 more source
Query Learning Algorithm for Residual Symbolic Finite Automata [PDF]
Electronic Proceedings in Theoretical Computer Science, 2019 We propose a query learning algorithm for residual symbolic finite automata (RSFAs). Symbolic finite automata (SFAs) are finite automata whose transitions are labeled by predicates over a Boolean algebra, in which a big collection of characters leading ...
Kaizaburo Chubachi +3 more
doaj +1 more source
Token Games and History-Deterministic Quantitative-Automata [PDF]
Logical Methods in Computer Science, 2023 A nondeterministic automaton is history-deterministic if its nondeterminism can be resolved by only considering the prefix of the word read so far. Due to their good compositional properties, history-deterministic automata are useful in solving games and
Udi Boker, Karoliina Lehtinen
doaj +1 more source
From Finite Automata to Regular Expressions and Back—A Summary on Descriptional Complexity [PDF]
Electronic Proceedings in Theoretical Computer Science, 2014 The equivalence of finite automata and regular expressions dates back to the seminal paper of Kleene on events in nerve nets and finite automata from 1956. In the present paper we tour a fragment of the literature and summarize results on upper and lower
Hermann Gruber, Markus Holzer
doaj +1 more source
Non-Deterministic Finite Cover Automata [PDF]
Scientific Annals of Computer Science, 2015 The concept of Deterministic Finite Cover Automata (DFCA) was introduced at WIA ’98, as a more compact representation than Deterministic Finite Automata (DFA) for finite languages.
C. Câmpeanu
doaj +1 more source
Mobile Learning Application for Language and Automata Theory using Android-based
JOIN: Jurnal Online Informatika, 2020 The language and automata theory are which required course must implemented by college student in informatic engineering study program. In this course, there are finite state automata (FSA) and deterministic finite automata (DFA) which are important ...
Maulana Muhamad Sulaiman +2 more
doaj +1 more source