Sciweavers

644 search results - page 114 / 129
» Precedence Automata and Languages
Sort
View
ICALP
2005
Springer
14 years 2 months ago
Preservation Under Extensions on Well-Behaved Finite Structures
A class of relational structures is said to have the extension preservation property if every first-order sentence that is preserved under extensions on the class is equivalent t...
Albert Atserias, Anuj Dawar, Martin Grohe
CEC
2003
IEEE
14 years 1 months ago
Learning DFA: evolution versus evidence driven state merging
Learning Deterministic Finite Automata (DFA) is a hard task that has been much studied within machine learning and evolutionary computation research. This paper presents a new met...
Simon M. Lucas, T. Jeff Reynolds
DOCENG
2003
ACM
14 years 1 months ago
Automating XML document structure transformations
This paper describes an implementation for syntax-directed transformation of XML documents from one structure to another. The system is based on the method which we have introduce...
Paula Leinonen
ESOP
2001
Springer
14 years 29 days ago
What Are Polymorphically-Typed Ambients?
The Ambient Calculus was developed by Cardelli and Gordon as a formal framework to study issues of mobility and migrant code [CG98]. We consider an Ambient Calculus where ambients...
Torben Amtoft, A. J. Kfoury, Santiago M. Peric&aac...
FDL
2007
IEEE
14 years 10 days ago
Towards Assertion Based Verification of Analog and Mixed Signal Designs Using PSL
Abstract-- Analog and Mixed Signal (AMS) designs are important integrated systems that link digital circuits to the analog world. Following the success of PSL verification methodol...
Ghiath Al Sammane, Mohamed H. Zaki, Zhi Jie Dong, ...