Results 1 to 10 of about 171,274 (141)
Bounded Languages Meet Cellular Automata with Sparse Communication [PDF]
Electronic Proceedings in Theoretical Computer Science, 2009 Cellular automata are one-dimensional arrays of interconnected interacting finite automata. We investigate one of the weakest classes, the real-time one-way cellular automata, and impose an additional restriction on their inter-cell communication by ...
Martin Kutrib, Andreas Malcher
doaj +5 more sources
Finite state verifiers with constant randomness [PDF]
Logical Methods in Computer Science, 2014 We give a new characterization of $\mathsf{NL}$ as the class of languages whose members have certificates that can be verified with small error in polynomial time by finite state machines that use a constant number of random bits, as opposed to its ...
Cem Say, Abuzer Yakaryilmaz
doaj +3 more sources
On tractability and congruence distributivity [PDF]
Logical Methods in Computer Science, 2007 Constraint languages that arise from finite algebras have recently been the object of study, especially in connection with the Dichotomy Conjecture of Feder and Vardi.
Emil Kiss, Matthew Valeriote
doaj +6 more sources
On Languages Accepted by P/T Systems Composed of joins [PDF]
Electronic Proceedings in Theoretical Computer Science, 2009 Recently, some studies linked the computational power of abstract computing systems based on multiset rewriting to models of Petri nets and the computation power of these nets to their topology.
Pierluigi Frisco, Oscar H. Ibarra
doaj +4 more sources
Bounded Symbolic Execution for Runtime Error Detection of Erlang Programs [PDF]
Electronic Proceedings in Theoretical Computer Science, 2018 Dynamically typed languages, like Erlang, allow developers to quickly write programs without explicitly providing any type information on expressions or function definitions. However, this feature makes those languages less reliable than statically typed
Emanuele De Angelis +4 more
doaj +5 more sources
Boundedness in languages of infinite words [PDF]
Logical Methods in Computer Science, 2017 We define a new class of languages of $\omega$-words, strictly extending $\omega$-regular languages. One way to present this new class is by a type of regular expressions.
Mikołaj Bojańczyk, Thomas Colcombet
doaj +3 more sources
Interacting via the Heap in the Presence of Recursion [PDF]
Electronic Proceedings in Theoretical Computer Science, 2012 Almost all modern imperative programming languages include operations for dynamically manipulating the heap, for example by allocating and deallocating objects, and by updating reference fields. In the presence of recursive procedures and local variables
Jurriaan Rot +4 more
doaj +5 more sources
Multimodal Worlds, Multilingual Selves: Fictional Linguistic Landscapes in Transnational Education [PDF]
Behavioral SciencesTransnational youth frequently navigate multiple languages and continually negotiate not only affiliation, but also the legitimacy of the languages they use within changing linguistic hierarchies.
Osman Solmaz
doaj +2 more sources
GRAPHICAL USER INTERFACE FOR BOUNDED-ADDITION FUZZY SPLICING SYSTEMS AND THEIR VARIANTS [PDF]
Malaysian Journal of Computing, 2023 A splicing system is one of the early theoretical proposals of the DNA-based computation device. The splicing operation starts when two DNA molecules are cut at specific subsequences with the presence of restriction enzymes: the first part is then ...
Mathuri Selvarajoo +3 more
doaj +1 more source
Finite Automata with Generalized Acceptance Criteria [PDF]
Discrete Mathematics & Theoretical Computer Science, 2001 We examine the power of nondeterministic finite automata with acceptance of an input word defined by a leaf language, i.e., a condition on the sequence of leaves in the automaton's computation tree.
Timo Peichl, Heribert Vollmer
doaj +2 more sources