A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2015; you can also visit the original URL.
The file type is application/pdf.
Filters
Example-based learning in computer-aided STEM education
2014
Communications of the ACM
Preserved Fulltext
, logic, automata theory, arithmetic, algebra, and geometry. ...
key insights Computing technologies can automate repetitive tasks in education, including problem generation, solution generation, and feedback generation, for numerous subject domains, including programming ...
Vardi for encouraging me to write this article. I thank Ben Zorn and the anonymous reviewers for providing valuable feedback on earlier versions of the draft. ...
doi:10.1145/2634273
fatcat:nwqjrxqzh5etnoehbygyoce3fq
How Can Automatic Feedback Help Students Construct Automata?
2015
ACM Transactions on Computer-Human Interaction
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Natural choices for feedback are binary feedback (correct/wrong) and a counterexample of a string that is processed incorrectly. ...
We focus on providing feedback for constructing a deterministic finite automaton that accepts strings that match a described pattern. ...
ACKNOWLEDGMENTS We thank Luca Aceto for using our tool in his course and helping us collecting feedback from his students. ...
doi:10.1145/2723163
fatcat:tovegrsyubbbdmisleyta5upta
MEASURE OF REGULAR LANGUAGES
2004
Demonstratio Mathematica
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
The language measure provides total ordering of partially ordered sets of sublanguages of a regular language to allow quantitative evaluation of the controlled behavior of deterministic finite state automata ...
Let L(Gi) be a regular language for a DFSA G{ = (Q, S, 6, qi,Qm)-For any K € 2 L ( Gi \ \fi\(K) < where 0 = 1-HnH«, and II is the state transition cost matrix of the DFSA. Proof. ...
For example, Fu et al. ...
doi:10.1515/dema-2004-0225
fatcat:zwigtwzrrvbdxdfvxkboibrxja
Model Checking Real-Time Properties on the Functional Layer of Autonomous Robots
[chapter]
2016
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
We illustrate our approach using a realistic autonomous navigation example. ...
We implement an automatic translation from GenoM, a robotics model-based software engineering framework, to the formal specification language Fiacre. ...
Some introductory material and examples can be found on the Fiacre site (www.laas.fr/fiacre). ...
doi:10.1007/978-3-319-47846-3_24
fatcat:oavf76htxfabthntvro7xvuti4
Signed real measure of regular languages for discrete-event automata
2003
International Journal of Control
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2006; you can also visit the original URL.
The file type is application/pdf.
It allows total ordering of a set of partially ordered sublanguages of a regular language for quantitative evaluation of the supervised behaviour of deterministic finite state automata (DFSA) under different ...
This paper reviews, expands, and clarifies the underlying concepts of a signed real measure of regular languages, which has been used as a novel tool for synthesis of discrete event supervisory control ...
Acknowledgements The author wishes to thank his former and current students and his colleagues for their contributions in the development of the language measure concept. ...
doi:10.1080/00207170310001635392
fatcat:l7gjy2d6ifdljamlfradwx5oou
Formal design constraints
1996
SIGPLAN notices
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2010; you can also visit the original URL.
The file type is application/pdf.
Examples of design constraints are: Classes with persistent instances should inherit only from other classes with persistent instances and should not provide asynchronous operations. ...
The language-based approach leads to di erent languages for di erent platforms or even for di erent versions of the same platform. ...
Acknowledgments We wish to thank anonymous reviewers for helpful comments on earlier versions of this paper. ...
doi:10.1145/236338.236376
fatcat:orhqvapgpjalfb2sefvfddnljy
Formal design constraints
1996
Proceedings of the 11th ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications - OOPSLA '96
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2010; you can also visit the original URL.
The file type is application/pdf.
Examples of design constraints are: Classes with persistent instances should inherit only from other classes with persistent instances and should not provide asynchronous operations. ...
The language-based approach leads to di erent languages for di erent platforms or even for di erent versions of the same platform. ...
Acknowledgments We wish to thank anonymous reviewers for helpful comments on earlier versions of this paper. ...
doi:10.1145/236337.236376
dblp:conf/oopsla/KlarlundKS96
fatcat:5u2beok2trd4rmwr3k6ikg6kce
Native Chemical Computation. A Generic Application of Oscillating Chemistry Illustrated With the Belousov-Zhabotinsky Reaction. A Review
2021
Frontiers in Chemistry
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
We review here recent work in this area establishing that all physically realizable computing automata, from Finite Automata (FA) (such as logic gates) to the Linearly Bound Automaton (LBA, a Turing Machine ...
Computing with molecules is at the center of complex natural phenomena, where the information contained in ordered sequences of molecules is used to implement functionalities of synthesized materials or ...
ACKNOWLEDGMENTS We thank REPSOL S.A. for their continued support. ...
doi:10.3389/fchem.2021.611120
pmid:34046394
pmcid:PMC8144498
fatcat:2xtxhr2ny5g4zoljsqlf62tbde
A Compiler Project with Learning Progression
2013
Proceedings of the Canadian Engineering Education Association (CEEA)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
We describe the design of an undergraduate compilers course for computer engineering students in which the projectis to write a simulator and synthesizer for (a subset of) VHDL. ...
The main pedagogical advantage of this project is that item bodies a learning progression: repetition with increasing complexity.This project involves two additional languages: a regular language for boolean ...
The learning progression for parsing starts with writing a regular expression to recognize W programs (lab 1) and proceeds to using a parser generator for V programs (lab 9). ...
doi:10.24908/pceea.v0i0.4798
fatcat:5qnyfkfstvhwfi447q43h4eipe
Generalizing input-driven languages: theoretical and practical benefits
[article]
2017
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
less expressive language families. ...
Regular languages (RL) are the simplest family in Chomsky's hierarchy. ...
Among them we mention Finite State Automata (FSA), which are used for various applications, not only in computer science, Regular Grammars, Regular Expressions, often used in computing for describing the ...
arXiv:1705.00984v1
fatcat:pnwhigq2q5httky7x7omvf67ri
Program sketching
2012
International Journal on Software Tools for Technology Transfer (STTT)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
Inductive synthesis refers to the process of generating candidate implementations from concrete examples of correct or incorrect behavior. ...
In order to generate an implementation from the programmer provided sketch, the synthesizer uses counterexample-guided inductive synthesis (CEGIS). ...
The formalism is very different from that used in automata-based synthesis. ...
doi:10.1007/s10009-012-0249-7
fatcat:mlktcgt2kve4jb6c7frrn3cz6a
Linguistic Annotation
[chapter]
2010
The Handbook of Computational Linguistics and Natural Language Processing
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
ACKNOWLEDGMENT We would like to thank the editors for their very useful comments. ...
Parts of this paper were written while the second author was a research fellow at the Center for the Study of Language and Information, Stanford University. ...
Operations on finite state automata We know from Section 4.3 that finite state automata are equivalent to regular expressions; we also know from Section 4.2 that the regular languages are closed under ...
doi:10.1002/9781444324044.ch10
fatcat:peq2ppl6gnfklh7gtwzbrt5xym
Computational Issues in Intelligent Control: Discrete-Event and Hybrid Systems
[chapter]
2000
Soft Computing and Intelligent Systems
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
In view of hybrid systems, we also review basic computational issues for hybrid automata. ...
Finally, we present a parallel computing architecture for intelligent control systems and we illustrate its advantages by considering parallel discrete event simulations. ...
Nikos Chrisochoides of the Computer Science and Engineering Department at the University of Notre Dame for his valuable assistance concerning the parallel computing architecture. ...
doi:10.1016/b978-012646490-0/50006-8
fatcat:tpqu57oywrhwtfcrvohzhr3trq
Morbig: a static parser for POSIX shell
2018
Proceedings of the 11th ACM SIGPLAN International Conference on Software Language Engineering - SLE 2018
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Token recognition cannot be specified by regular expressions, lexical analysis depends on the parsing context and the evaluation context, and the shell grammar given in the specification is ambiguous. ...
This makes the standard usage of Lex and Yacc as a pipeline inadequate for the implementation of a parser for POSIX shell. ...
We also thank Patricio Pelliccione and Davide Di Ruscio for discussion of their work ...
doi:10.1145/3276604.3276615
dblp:conf/sle/Regis-GianasJT18
fatcat:n6mgvlrakjeeta4mbtbv2u5vmi
A 2007 model curriculum for a liberal arts degree in computer science
2007
Journal on Educational Resources in Computing
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2016; you can also visit the original URL.
The file type is application/pdf.
A 2007 model curriculum for a liberal arts degree in computer science. ACM ...
projects they wish to assign. ...
C.3.1 Course Outline -Overview (3 hours) -language families -paradigms -virtual machines -design principles -Formal grammars and language analysis (6 hours) -regular expressions and context free grammars ...
doi:10.1145/1240200.1240202
fatcat:nce45y7v5vgyzkpq3j5ciqhozy
« Previous
Showing results 1 — 15 out of 429 results