Results 1 to 10 of about 45,230 (224)
Computer Aided Verification32nd International Conference, 2020 Computer science class enrollments have rapidly risen in the past decade. With current class sizes, standard approaches to grading and providing personalized feedback are no longer possible and new techniques become both feasible and necessary.
D’Antoni L +4 more
europepmc +2 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
From Automata to Multiautomata via Theory of Hypercompositional Structures
Mathematics, 2021 In this paper, we study two important problems related to quasi-multiautomata: the complicated nature of verification of the GMAC condition for systems of quasi-multiautomata, and the fact that the nature of quasi-multiautomata has deviated from the ...
Štěpán Křehlík +2 more
doaj +1 more source
Resynchronized Uniformization and Definability Problems for Rational Relations [PDF]
Discrete Mathematics & Theoretical Computer Science, 2023 Regular synchronization languages can be used to define rational relations of finite words, and to characterize subclasses of rational relations, like automatic or recognizable relations.
Christof Löding, Sarah Winter
doaj +1 more source
Transfinite Lyndon words [PDF]
Logical Methods in Computer Science, 2020 In this paper, we extend the notion of Lyndon word to transfinite words. We prove two main results. We first show that, given a transfinite word, there exists a unique factorization in Lyndon words that are densely non-increasing, a relaxation of the ...
Olivier Carton, Luc Boasson
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
Most Complex Regular Ideal Languages [PDF]
Discrete Mathematics & Theoretical Computer Science, 2016 A right ideal (left ideal, two-sided ideal) is a non-empty language $L$ over an alphabet $\Sigma$ such that $L=L\Sigma^*$ ($L=\Sigma^*L$, $L=\Sigma^*L\Sigma^*$). Let $k=3$ for right ideals, 4 for left ideals and 5 for two-sided ideals. We show that there
Janusz Brzozowski +2 more
doaj +1 more source