Results 11 to 20 of about 6,057,560 (362)
Theoretical Computer Science, 1994 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
David L. Dill, Rajeev Alur
openaire +3 more sources
An algebraic theory of interface automata [PDF]
Theoretical Computer Science, 2014 We formulate a compositional specification theory for interface automata, where a component model specifies the allowed sequences of input and output interactions with the environment. A trace-based linear-time refinement is provided, which is the weakest preorder preserving substitutivity of components, and is weaker than the classical alternating ...
Chris Chilton +2 more
openaire +2 more sources
Migrating teaching of automata theory to a digital platform
South African Computer JournalThis research explores the challenges of teaching automata theory in computer science and proposes a digital solution to enhance learning experiences. Traditionally taught through pen and paper, automata theory often appears daunting to students due to ...
Steven Jordaan +2 more
doaj +2 more sources
Elementary definability of the class of universal hypergraphic automata in the class of semigroups [PDF]
Известия Саратовского университета. Новая серия: Математика. Механика. Информатика, 2022 Hypergraphic automata are automata, state sets and output symbol sets of which are hypergraphs, being invariant under actions of transition and output functions. Universally attracting objects in the category of hypergraphic automata are called universal
Molchanov, Vladimir Aleksandrovich +1 more
doaj +1 more source
Residuality and Learning for Nondeterministic Nominal Automata [PDF]
Logical Methods in Computer Science, 2022 We are motivated by the following question: which data languages admit an active learning algorithm? This question was left open in previous work by the authors, and is particularly challenging for languages recognised by nondeterministic automata.
Joshua Moerman, Matteo Sammartino
doaj +1 more source
Composite Neutrosophic Finite Automata [PDF]
Neutrosophic Sets and Systems, 2020 The idea behind the neutrosophic set is we can connect the concept by dynamics of opposite interacts and its neutral that are uncertain and get common parts.
J. Kavikumar +4 more
doaj +1 more source
Transformers Learn Shortcuts to Automata [PDF]
International Conference on Learning Representations, 2022 Algorithmic reasoning requires capabilities which are most naturally understood through recurrent models of computation, like the Turing machine. However, Transformer models, while lacking recurrence, are able to perform such reasoning using far fewer ...
Bingbin Liu +4 more
semanticscholar +1 more source
Four-valued expansions of Dunn-Belnap's logic (I): Basic characterizations
Bulletin of the Section of Logic, 2020 Basic results of the paper are that any four-valued expansion L4 of Dunn-Belnap's logic DB4 is de_ned by a unique (up to isomorphism) conjunctive matrix ℳ4 with exactly two distinguished values over an expansion 𝔄4 of a De Morgan non-Boolean four-valued ...
Alexej P. Pynko
doaj +1 more source
Mobile Learning Application for Language and Automata Theory using Android-based
JOIN: Jurnal Online Informatika, 2020 The language and automata theory are which required course must implemented by college student in informatic engineering study program. In this course, there are finite state automata (FSA) and deterministic finite automata (DFA) which are important ...
Maulana Muhamad Sulaiman +2 more
doaj +1 more source
Nominal Cellular Automata [PDF]
Electronic Proceedings in Theoretical Computer Science, 2016 The emerging field of Nominal Computation Theory is concerned with the theory of Nominal Sets and its applications to Computer Science. We investigate here the impact of nominal sets on the definition of Cellular Automata and on their computational ...
Tommaso Bolognesi, Vincenzo Ciancia
doaj +1 more source