Výsledky vyhľadávania - Theory of computation Formal languages and automata theory Formalisms Rewrite systems

Theory of Automata, Formal Languages and Computation Autor 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…”
Získať plný text

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

Získať plný text

Incremental Context-free Grammar Inference in Black Box Settings Autor 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…”
Získať plný text

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

“…Motivated by the study of effectful programming languages and computations, we introduce a relational theory of monadic rewriting systems…”
Získať plný text

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

“…We investigate commutative images of languages recognised by register automata and grammars…”
Získať plný text

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

“…) and rewrites with a more compact implementation. Both exact synthesis and heuristic methods can be adopted to optimize MFFWs…”
Získať plný text

Positive First-order Logic on Words Autor Kuperberg, Denis

“… We show that there is an FO-definable language that is monotone in monadic predicates but not definable in FO…”
Získať plný text

SD-Regular Transducer Expressions for Aperiodic Transformations Autor 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…”
Získať plný text

First-order definability of rational transductions: An algebraic approach Autor Filiot, Emmanuel, Gauwin, Olivier, Lhote, Nathan

“…The algebraic theory of rational languages has provided powerful decidability results…”
Získať plný text

Incremental model synchronization for multiple updates Autor Giese, Holger, Hildebrandt, Stephan

“…One required capability to make the vision of model-driven software development reality is, that changes in the models can be consistently propagated between…”
Získať plný text

Term rewriting and lambda calculus Autor Klop, Jan Willem

Získať plný text

Towards a Basis for Endochronous Functions in Dataflow Process Networks Autor Theis, Daniel, Schneider, Klaus

“…To ensure deterministic computations, nodes of Kahn process networks must implement sequential functions with blocking read methods…”
Získať plný text

Omnisc'IO: a grammar-based approach to spatial and temporal I/O patterns prediction Autor Dorier, Matthieu, Ibrahim, Shadi, Antoniu, Gabriel, Ross, Rob

“…The increasing gap between the computation performance of post-petascale machines and the performance of their I/O subsystem has motivated many I/O optimizations including prefetching, caching, and scheduling techniques…”
Získať plný text

Graph rewriting and transformation (GReAT): a solution for the model integrated computing (MIC) bottleneck Autor Agrawal, Aditya

“…Graph grammars and transformations (GGT) have been a field of theoretical study for over two decades. However, it has produced only a handful of practical…”
Získať plný text

A formal executable semantics of Verilog Autor Meredith, Patrick, Katelman, Michael, Meseguer, Jose, Rosu, Grigore

“…This paper describes a formal executable semantics for the Verilog hardware description language…”
Získať plný text

FPGA in Rough-Granular Computing: Reduct Generation Autor Kopczynski, Maciej, Grzes, Tomasz, Stepaniuk, Jaroslaw

“… Presented architecture has been tested on a real-world data. Obtained results confirm the huge acceleration of the computation time using hardware supporting reduct…”
Získať plný text

The CommUnity Workbench Autor Oliveira, Cristovao, Wermelinger, Michel

Získať plný text

Constraint Based Syntax of Modifiers Autor Loukanova, R.

“…The paper introduces a technique for grammar rules that licence post-and pre-modified phrases, by using a generalized approach to constraint based lexicalized…”
Získať plný text

Directed-Logical Testing for Functional Verification of Microprocessors Autor Katelman, M., Meseguer, J., Escobar, S.

“… to drive a simulation-based methodology. However, formal methods are, in particular, gaining wider adoption and are seen as having potential to bridge large gaps left by current techniques…”
Získať plný text

BehaviorScope: Real-Time Remote Human Monitoring Using Sensor Networks Autor Lymberopoulos, Dimitrios, Bamis, Athanasios, Teixeira, Thiago, Savvides, Andreas

“…In this demonstration we present the Behavior Scope, a system for interpreting human activity patterns using a sensor network and its application to elder monitoring in assisted living…”
Získať plný text