Results 11 to 20 of about 2,186 (279)
Automata Theory and Formal Languages [PDF]
, 2008 In this book we present some basic notions and results on Automata Theory, For- mal Language Theory, Computability Theory, and Parsing Theory. In particular, we consider the class of regular languages which are related to the class of finite automata, and the class of the context-free languages which are related to the class of pushdown automata.
PETTOROSSI, ALBERTO
core +5 more sources
Simulators for formal languages, automata and theory of computation with focus on JFLAP
, 2013 This report discusses simulators in automata theory and which one should be best for use in laboratory assignments. Currently, the Formal Languages, Automata and Theory of Computation course (FABER) at Mälardalen University uses the JFLAP simulator for extra exercises. To see if any other simulators would be useful either along with JFLAP or standalone,
Fransson, Tobias
core +5 more sources
CPT443 – Automata Theory & Formal Languages (Teori Automata & Bahasa Formal) [PDF]
, 2021 Second Semester Examination 2020/2021 Academic Session July 2021 CPT443 – Automata Theory & Formal Languages (Teori Automata & Bahasa Formal) Duration : 2 hours (Masa : 2 ...
PPSKOM, Pusat Pengajian Sains Komputer
core +1 more source
Equivalence checking for weak bi-Kleene algebra [PDF]
Logical Methods in Computer Science, 2021 Pomset automata are an operational model of weak bi-Kleene algebra, which describes programs that can fork an execution into parallel threads, upon completion of which execution can join to resume as a single thread.
Tobias Kappé +4 more
doaj +1 more source
The Power-Set Construction for Tree Algebras [PDF]
Logical Methods in Computer Science, 2023 We study power-set operations on classes of trees and tree algebras. Our main result consists of a distributive law between the tree monad and the upwards-closed power-set monad, in the case where all trees are assumed to be linear.
Achim Blumensath
doaj +1 more source
A Characterization of Morphic Words with Polynomial Growth [PDF]
Discrete Mathematics & Theoretical Computer Science, 2020 A morphic word is obtained by iterating a morphism to generate an infinite word, and then applying a coding. We characterize morphic words with polynomial growth in terms of a new type of infinite word called a $\textit{zigzag word}$.
Tim Smith
doaj +1 more source
New tools for state complexity [PDF]
Discrete Mathematics & Theoretical Computer Science, 2020 A monster is an automaton in which every function from states to states is represented by at least one letter. A modifier is a set of functions allowing one to transform a set of automata into one automaton.
Pascal Caron +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
Active Learning of Deterministic Transducers with Outputs in Arbitrary Monoids [PDF]
Logical Methods in Computer ScienceWe study monoidal transducers, transition systems arising as deterministic automata whose transitions also produce outputs in an arbitrary monoid, for instance allowing outputs to commute or to cancel out.
Quentin Aristote
doaj +1 more source
Edit Distance for Pushdown Automata [PDF]
Logical Methods in Computer Science, 2017 The edit distance between two words $w_1, w_2$ is the minimal number of word operations (letter insertions, deletions, and substitutions) necessary to transform $w_1$ to $w_2$.
Krishnendu Chatterjee +3 more
doaj +1 more source