Results 31 to 40 of about 663,881 (275)
Fault tolerant parallel pattern recognition [PDF]
, 2000 The general capabilities of fault tolerant computations in one-way and two-way linear cellular arrays are investigated in terms of pattern recognition.
Kutrib, Martin, Löwe, Jan-Thomas
core +1 more source
Logical Methods in Computer Science, 2017 Kleene algebra axioms are complete with respect to both language models and binary relation models. In particular, two regular expressions recognise the same language if and only if they are universally equivalent in the model of binary relations.
Paul Brunet, Damien Pous
doaj +1 more source
Solutions of twisted word equations, EDT0L languages, and context-free groups [PDF]
, 2017 © Volker Diekert and Murray Elder; 1998 ACM Subject Classification F.2.2 Nonnumerical Algorithms and Problems, F.4.2 Grammars and Other Rewriting Systems, F.4.3 Formal Languages. We prove that the full solution set of a twisted word equation with regular
Diekert, V, Elder, M
core +1 more source
Almost Every Simply Typed Lambda-Term Has a Long Beta-Reduction Sequence [PDF]
Logical Methods in Computer Science, 2019 It is well known that the length of a beta-reduction sequence of a simply typed lambda-term of order k can be huge; it is as large as k-fold exponential in the size of the lambda-term in the worst case.
Kazuyuki Asada +3 more
doaj +1 more source
A Calculus for Timed Automata [PDF]
, 1996 A language for representing timed automata is introduced. Its semantics is defined in terms of timed automata. This language is complete in the sense that any timed automaton can be represented by a term in the language.
Brinksma, Hendrik, d' Argenio, P.R.
core +5 more sources
On the Expressive Power of 2-Stack Visibly Pushdown Automata [PDF]
Logical Methods in Computer Science, 2008 Visibly pushdown automata are input-driven pushdown automata that recognize some non-regular context-free languages while preserving the nice closure and decidability properties of finite automata. Visibly pushdown automata with multiple stacks have been
Benedikt Bollig
doaj +1 more source
Journal of universal computer science (Online), 1996 We show that it is decidable whether or not the set of coe cients of a given Q-algebraic sequence is nite. The same question is undecidable for Q-algebraic series. We consider also prime factors of algebraic series.
J. Honkala
semanticscholar +1 more source
Correlation between tumor necrosis factor-alpha and D-dimer levels in non-small cell lung cancer patients [PDF]
, 2004 The present study was designed to investigate whether a correlation exists between IL-6, TNF-alpha and coagulation (Thrombin-antithrombin, TATc) or fibrinolysis (D-dimer) activation in non-small cell lung cancer (NSCLC) patients.
Aloe, S +14 more
core +1 more source
Logic Meets Algebra: the Case of Regular Languages [PDF]
Logical Methods in Computer Science, 2007 The study of finite automata and regular languages is a privileged meeting point of algebra and logic. Since the work of Buchi, regular languages have been classified according to their descriptive complexity, i.e.
Pascal Tesson, Denis Therien
doaj +1 more source
On N-algebraic Parikh slender power series
Journal of universal computer science (Online), 1997 In a recent paper we introduced Parikh slender languages and series as a generalization of slender languages de ned and studied by Andra siu, Dassow, P aun and Salomaa.
J. Honkala
semanticscholar +1 more source