Results 21 to 30 of about 43,821 (313)
An Introduction to Formal Languages and Automata [PDF]
The Computer Journal, 1992 Ken Moody
openaire +3 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 ...
Moura, Paulo, Dias, Artur Miguel
openaire +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
openaire +3 more sources
Automata and Formal Languages for Next Generation Sequencing Data
Electronic Proceedings in Theoretical Computer Science, 2017 Gianluca Della Vedova, Paola Bonizzoni
openaire +3 more sources
Rational stochastic automata in formal language theory [PDF]
Banach Center Publications, 1982 Paavo Turakainen
openaire +3 more sources
Crisp-determinization of weighted tree automata over strong bimonoids [PDF]
Discrete Mathematics & Theoretical Computer Science, 2021 We consider weighted tree automata (wta) over strong bimonoids and their initial algebra semantics and their run semantics. There are wta for which these semantics are different; however, for bottom-up deterministic wta and for wta over semirings, the ...
Zoltán Fülöp +2 more
doaj +1 more source
Locality and Centrality: The Variety ZG [PDF]
Logical Methods in Computer Science, 2023 We study the variety ZG of monoids where the elements that belong to a group are central, i.e., commute with all other elements. We show that ZG is local, that is, the semidirect product ZG * D of ZG by definite semigroups is equal to LZG, the variety of
Antoine Amarilli, Charles Paperman
doaj +1 more source
A model of actors and grey failures [PDF]
Logical Methods in Computer Science, 2023 Existing models for the analysis of concurrent processes tend to focus on fail-stop failures, where processes are either working or permanently stopped, and their state (working/stopped) is known.
Laura Bocchi +3 more
doaj +1 more source
Separation for dot-depth two [PDF]
Logical Methods in Computer Science, 2021 The dot-depth hierarchy of Brzozowski and Cohen classifies the star-free languages of finite words. By a theorem of McNaughton and Papert, these are also the first-order definable languages.
Thomas Place, Marc Zeitoun
doaj +1 more source
Minimization of visibly pushdown automata is NP-complete [PDF]
Logical Methods in Computer Science, 2020 We show that the minimization of visibly pushdown automata is NP-complete. This result is obtained by introducing immersions, that recognize multiple languages (over a usual, non-visible alphabet) using a common deterministic transition graph, such that ...
Olivier Gauwin +2 more
doaj +1 more source