Results 11 to 20 of about 46,330 (328)
VisA: A Tool for Visualizing and Animating Automata and Formal Languages [PDF]
, 1998 The use of multimedia tools in education has gained a lot of interest during the last decade (see, e.g., [1]). Free standing multimedia as well as tutorials distributed via the Internet provide the potential for students to learn on their own, at their own pace, and in their own sequence, whereas textbooks or instructors usually impose a sequence how ...
Markus Holzer, Muriel Quenzer
openalex +4 more sources
Automata and formal languages [PDF]
, 2014 1) (20 points) Use CYK algorithm a) does string 'aabb' belong to the grammar? b) does string 'aabba' belong to the grammar? c) does string 'abbbb' belong to the grammar?
Dominique Perrin
semanticscholar +2 more sources
L-FLAT: Logtalk Toolkit for Formal Languages and Automata Theory
, 2011 We describe L-FLAT, a Logtalk Toolkit for teaching Formal Languages and Automata Theory. L-FLAT supports the definition of \textsl{alphabets}, the definition of \textsl{orders} over alphabet symbols, the partial definition of \textsl{languages} using unit tests, and the definition of \textsl{mechanisms}, which implement language generators or language ...
Paulo Moura, Artur Miguel Dias
openalex +4 more sources
Experimental Design of Formal Language and Automata Course [PDF]
Proceedings of the 2018 5th International Conference on Education, Management, Arts, Economics and Social Science (ICEMAESS 2018), 2018 Qing he Pan
openalex +3 more sources
Automata and Formal Languages for Next Generation Sequencing Data
Electronic Proceedings in Theoretical Computer Science, 2017 Paola Bonizzoni, Gianluca Della Vedova
openalex +3 more sources
Rational stochastic automata in formal language theory [PDF]
Banach Center Publications, 1982 Paavo Turakainen
openalex +3 more sources
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