Results 31 to 40 of about 51,114 (288)
DETERMINISTIC FINITE AUTOMATA LEARNING USING COUNTEREXAMPLE GUIDED ABSTRACTION REFINEMENT [PDF]
Научно-технический вестник информационных технологий, механики и оптики, 2020 Subject of Research. The paper studies minimum-sized deterministic finite automata inferring problem. A hybrid method is developed and implemented reducing the given problem to Boolean satisfiability (SAT) technique and at the same time applying a ...
Ilya T. Zakirzyanov
doaj +1 more source
Using the past for resolving the future
Frontiers in Computer Science, 2023 Nondeterminism models an ability to see the future: An automaton with an infinite look ahead can successfully resolve its nondeterministic choices. An automaton is history deterministic (HD) if it can successfully resolve its nondeterministic choices in ...
Orna Kupferman
doaj +1 more source
Novel and Fast Image Segmentation Algorithm Based on Deterministic Finite Automaton
Yu Wang +5 more
+4 more sources
Representing Small Ordinals by Finite Automata [PDF]
Electronic Proceedings in Theoretical Computer Science, 2010 It is known that an ordinal is the order type of the lexicographic ordering of a regular language if and only if it is less than omega^omega. We design a polynomial time algorithm that constructs, for each well-ordered regular language L with respect to ...
Zoltan Ésik
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
Testing the Equivalence of Regular Languages [PDF]
Electronic Proceedings in Theoretical Computer Science, 2009 The minimal deterministic finite automaton is generally used to determine regular languages equality. Antimirov and Mosses proposed a rewrite system for deciding regular expressions equivalence of which Almeida et al.
Marco Almeida +2 more
doaj +1 more source
Simplifying Nondeterministic Finite Cover Automata [PDF]
Electronic Proceedings in Theoretical Computer Science, 2014 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.
Cezar Câmpeanu
doaj +1 more source
A coalgebraic take on regular and $\omega$-regular behaviours [PDF]
Logical Methods in Computer Science, 2021 We present a general coalgebraic setting in which we define finite and infinite behaviour with B\"uchi acceptance condition for systems whose type is a monad.
Tomasz Brengos
doaj +1 more source
Algebra of Finite Automata as a Mathematical Model of the Digital Twin of Smart Production
Современные информационные технологии и IT-образование, 2022 The article is devoted to the development of the finite automata algebra of a special type DTA (Digital Twin Algebra), designed for mathematical modeling of production digital twins.
Dmitry Gapanovich, Vladimir Sukhomlin
doaj +1 more source
, 2013 We show that every regular language defines a unique nondeterministic finite automaton (NFA), which we call "\'atomaton", whose states are the "atoms" of the language, that is, non-empty intersections of complemented or uncomplemented left quotients of ...
Brzozowski, Janusz, Tamm, Hellis
core +2 more sources