Suchergebnisse - Theory of computation Formal languages and automata theory Formalisms

Theory of Automata, Formal Languages and Computation von Xavier, S.P.E

“… This book is devoted to Finite Automata and their properties. Pushdown Automata provides a class of models and enables the analysis of context-free languages …”
Volltext

Supply Of An Introduction To Automata Theory Formal Languages, An Introduction To Automata Theory, Formal Languages And Computation, Algorithm Design And Analysis, Analysis And Design Of Algorithms, Design Analysis Of Algorithms, Discrete Mathematics

Volltext

A Relational Theory of Monadic Rewriting Systems, Part I von Gavazzo, Francesco, Faggian, Claudia

“… Motivated by the study of effectful programming languages and computations, we introduce a relational theory of monadic rewriting systems …”
Volltext

Parikh's theorem for infinite alphabets von Hofman, Piotr, Juzepczuk, Marta, Lasota, Slawomir, Pattathurajan, Mohnish

“… We investigate commutative images of languages recognised by register automata and grammars …”
Volltext

Positive First-order Logic on Words von Kuperberg, Denis

“… We show that there is an FO-definable language that is monotone in monadic predicates but not definable in FO …”
Volltext

SD-Regular Transducer Expressions for Aperiodic Transformations von Dartois, Luc, Gastin, Paul, Krishna, Shankara Narayanan

“… (star-free expressions = aperiodic languages) result of Schützenberger. Our result also generalizes a lesser known characterization by Schutzenberger of aperiodic languages by SD-regular expressions (SD=AP …”
Volltext

Incremental Context-free Grammar Inference in Black Box Settings von Li, Feifei, Chen, Xiao, Xiao, Xi, Sun, Xiaoyu, Chen, Chuan, Wang, Shaohua, Han, Jitao

“… We have observed that these approaches suffer from low quality and readability, primarily because they process entire example strings, adding to the complexity and substantially slowing down computations …”
Volltext

Behavioural Preorders via Graded Monads von Ford, Chase, Milius, Stefan, Schroder, Lutz

“… Often, such behavioural preorders are characterized in terms of theory inclusion in dedicated characteristic logics; e.g …”
Volltext

Combining Nondeterminism, Probability, and Termination: Equational and Metric Reasoning von Mio, Matteo, Sarkis, Ralph, Vignudelli, Valeria

“… We study monads resulting from the combination of nondeterministic and probabilistic behaviour with the possibility of termination, which is essential in …”
Volltext

A Database Dependent Framework for K-Input Maximum Fanout-Free Window Rewriting von Zhu, Xuliang, Tang, Ruofei, Chen, Lei, Li, Xing, Huang, Xin, Yuan, Mingxuan, Sheng, Weihua, Xu, Jianliang

“… Rewriting is a widely used logic optimization approach incorporated in most commercial logic synthesis tools. In this paper, we present a new rewriting method …”
Volltext

Fixed-Points for Quantitative Equational Logics von Mardare, Radu, Panangaden, Prakash, Plotkin, Gordon

“… The result is a novel theory of fixed points which can not only provide solutions to the traditional fixed-point equations but we can also define the rate of convergence to the fixed point …”
Volltext

The Smash Product of Monoidal Theories von Hadzihasanovic, Amar

“… The tensor product of props was defined by Hackney and Robertson as an extension of the Boardman-Vogt product of operads to more general monoidal theories …”
Volltext

An Algebraic Characterisation of First-Order Logic with Neighbour von Manuel, Amaldev, Nevatia, Dhruv

“… For this, we consider languages of finite words over alphabets with an involution on them. The natural algebras for such languages are involution semigroups …”
Volltext

Types Are Internal ∞-Groupoids von Finster, Eric, Allioux, Antoine, Sozeau, Matthieu

“… By extending type theory with a universe of definitionally associative and unital polynomial monads, we show how to arrive at a definition of opetopic type which is able to encode a number of fully …”
Volltext

Constraint Satisfaction Problems over Finite Structures von Barto, Libor, DeMeo, William, Mottet, Antoine

“… We initiate a systematic study of the computational complexity of the Constraint Satisfaction Problem (CSP) over finite structures that may contain both …”
Volltext

Varieties of Languages in a Category von Adamek, Jiri, Myers, Robert S. R., Urbat, Henning, Milius, Stefan

“… Eilenberg's variety theorem, a centerpiece of algebraic automata theory, establishes a bijective correspondence between varieties of languages and pseudovarieties of monoids …”
Volltext

Monadic Second-Order Logic and Bisimulation Invariance for Coalgebras von Enqvist, Sebastian, Seifan, Fatemeh, Venema, Yde

“… of this logic into a class of automata, relative to the class of T-co algebras that admit a tree-like …”
Volltext

Programs for Cheap von Hackett, Jennifer, Hutton, Graham

“… I will tell you an optimization theorem that the operator satisfies. As an added bonus, I will also give you a proof of correctness for the optimisation, along with a formal guarantee about its effect on performance …”
Volltext

Normalization for Cubical Type Theory von Sterling, Jonathan, Angiuli, Carlo

“… We prove normalization for (univalent, Cartesian) cubical type theory, closing the last major open problem in the syntactic metatheory of cubical type theory …”
Volltext

Comonadic semantics for guarded fragments von Abramsky, Samson, Marsden, Dan

“… In previous work ([1], [2], [3]), it has been shown how a range of model comparison games which play a central role in finite model theory, including Ehrenfeucht-Fraïssé …”
Volltext