Filters








47,615 Hits in 3.6 sec

Functional Automata - Formal Languages for Computer Science Students

Marco T. Morazán, Rosario Antunez
2014 Electronic Proceedings in Theoretical Computer Science  
It describes the implementation and the classroom use of a library, FSM, designed to provide students with the opportunity to experiment and test their designs using state machines, grammars, and regular  ...  In addition, the library easily allows students to implement the algorithms they develop as part of the constructive proofs they write.  ...  This article describes a Racket library, FSM, designed to provide students with the opportunity to implement and to test their designs using finite-state machines, regular expressions, regular grammars  ... 
doi:10.4204/eptcs.170.2 fatcat:pnspvuqzzrewdoasyawt3thbly

Decidability of Liveness on the TSO Memory Model [article]

Chao Wang, Gustavo Petri, Yi Lv, Teng Long, Zhiming Liu
2021 arXiv   pre-print
However, the problem of decidability of liveness for finite state concurrent programs running on relaxed memory models remains open.  ...  Our library needs to ensure that, in each infinite library execution simulating an infinite execution of the lossy channel machine, methods are "fixed to process", in other words, the same method must  ...  Perfect/Lossy Channel Machines A channel machine [1, 2] is a finite control machine equipped with channels of unbounded size. It can perform send and receive operations on its channels.  ... 
arXiv:2107.09930v1 fatcat:ey3zjrppdzd23cksyafi3ksw2y

Compositional Temporal Synthesis

Moshe Y. Vardi
2012 2012 Ninth International Conference on Quantitative Evaluation of Systems  
. • Task: Check that P |= ϕ Success: • Algorithmic methods: temporal specifications and finite-state programs. • Also: Certain classes of infinite-state programs • Tools: SMV, SPIN, SLAM, etc. • Impact  ...  Components I: Transducers Transducer: A simple model of a reactive system -a finite-state machine with inputs and outputs (Moore machine). • Transducers are receptive. • Output depends on state alone.  ...  Solution: Alur et al. • Nested Word: Description of call-and-return computations -sequence of letters, plus calls, and matching returns, when exist -Traces of pushdown machines with pushes and pops made  ... 
doi:10.1109/qest.2012.39 dblp:conf/qest/Vardi12 fatcat:7ytzkyl2argdfndnm44zkoly4m

More powerful biomolecular computers [article]

Janusz Blasiak, Tadeusz Krasinski, Tomasz Poplawski, Sebastian Sakowski
2011 arXiv   pre-print
This creates an opportunity to implement in laboratories of more complex finite automata and other theoretical models of computers: pushdown automata, Turing machines.  ...  The first practical laboratory implementation of the general theoretical model of a machine performing DNA-based calculations was a simple two-symbol two-state finite automaton established by Benenson  ...  We also proposed to built DNA library of inputs and transition rules, which can be used as needed.  ... 
arXiv:1109.5893v1 fatcat:4zuo4yn5ezf2xpksx3qe4cuony

From Sets to Bits in Coq [chapter]

Arthur Blot, Pierre-Évariste Dagand, Julia Lawall
2016 Lecture Notes in Computer Science  
Our library enables a seamless interaction of sets for computing -bitsets -and sets for proving -finite sets.  ...  In the Coq proof assistant, we implement a bitset library and prove its correctness with respect to a formalization of finite sets.  ...  ability to efficiently process machine words.  ... 
doi:10.1007/978-3-319-29604-3_2 fatcat:xc37xrcbczeu5kc3frllvds7lu

Simulating Finite Eilenberg Machines with a Reactive Engine

Benoît Razet
2011 Electronical Notes in Theoretical Computer Science  
They generalize many finite state machines. We consider in the present work the subclass of finite Eilenberg machines for which we provide an executable complete simulator.  ...  As an example, we present a pushdown automaton (PDA) recognizing ambiguous λ-terms is shown to be a finite Eilenberg machine.  ...  Since deterministic and non-deterministic finite automata (DFA and NFA) and real-time transducers are particular finite Eilenberg machines, our reactive engine can be used to solve the word problem on  ... 
doi:10.1016/j.entcs.2011.02.019 fatcat:4wgfhaovqjb7pgp6ydh4idqrtm

Synthesis from Component Libraries [chapter]

Yoad Lustig, Moshe Y. Vardi
2009 Lecture Notes in Computer Science  
In this work we define and study the problem of LTL synthesis from libraries of reusable components.  ...  Furthermore, other contexts, such as web-service orchestration, can be modeled as synthesis of a system from a library of components.  ...  A transducer, (also known as a Moore machine [13] ) is an deterministic finite automaton with outputs.  ... 
doi:10.1007/978-3-642-00596-1_28 fatcat:hywezcqgnja4tcpcp245qsv2sq

Synthesis from component libraries

Yoad Lustig, Moshe Y. Vardi
2012 International Journal on Software Tools for Technology Transfer (STTT)  
In this work we define and study the problem of LTL synthesis from libraries of reusable components.  ...  Furthermore, other contexts, such as web-service orchestration, can be modeled as synthesis of a system from a library of components.  ...  A transducer, (also known as a Moore machine [13] ) is an deterministic finite automaton with outputs.  ... 
doi:10.1007/s10009-012-0236-z fatcat:35tb36b225eslpduiori2wiaz4

Massively Parallel Finite Element Programming [chapter]

Timo Heister, Martin Kronbichler, Wolfgang Bangerth
2010 Lecture Notes in Computer Science  
We give an overview of our effort to enable the modern and generic finite element library deal.II to take advantage of the power of large clusters.  ...  Existing generic finite element libraries often restrict the parallelization to parallel linear algebra routines. This is a limiting factor when solving on more than a few hundreds of cores.  ...  Because we chose to recreate a local triangulation on each machine, most of the finite element library works without modification, e.g. implementation of finite element spaces.  ... 
doi:10.1007/978-3-642-15646-5_13 fatcat:4pwfqkeok5d7xgof6g3ocidsba

OpenNWA: A Nested-Word Automaton Library [chapter]

Evan Driscoll, Aditya Thakur, Thomas Reps
2012 Lecture Notes in Computer Science  
Nested-word automata (NWAs) are a language formalism that helps bridge the gap between finite-state automata and pushdown automata.  ...  This paper describes OpenNWA, a C++ library for working with NWAs. The library provides the expected automata-theoretic operations, such as intersection, determinization, and complementation.  ...  VPAs and their languages are another formalism which can be seen as an alternative encoding of NWAs and nested-word languages [3] . VPAlib [9] is a general-purpose library implementing VPAs.  ... 
doi:10.1007/978-3-642-31424-7_47 fatcat:y7efqdwq3vhaxfq66v5lqv4gee

Machine Learning Methods and 'Real-Time' Economics

Vladimir Dorozhinsky, Arsen Khadikov, Nina Zholtkevych
2016 International Conference on Information and Communication Technologies in Education, Research, and Industrial Applications  
In the paper some machine-learning method for synthesis an on-fly event acceptor is proposed. Such an acceptor has become necessary for the technique of the on-fly event processing.  ...  Gregoriy Zholtkevych for the idea proposed to them: to use machine learning methods for the synthesis of the logical structure of the on-fly event processing mechanism.  ...  Any CEP-machine is a quintuple M = (X, Y, H, h 0 , α) with the following constituents: the alphabet of atomic messages X, which is a finite set; the alphabet of machine responses Y , which is a finite  ... 
dblp:conf/icteri/DorozhinskyKZ16 fatcat:f6m6roalifhvdmgx6jadeod54e

Simulations of Quantum Finite Automata [chapter]

Gustaw Lippa, Krzysztof Makieła, Marcin Kuta
2020 Lecture Notes in Computer Science  
This paper presents a Python library to simulate different kinds of quantum finite automata on a classical computer.  ...  We have conducted experiments to measure the time complexity of the simulation in a function of the automaton size, alphabet size and word length. Examples of library usage are also provided.  ...  The task of quantum finite automata is to recognise quantum languages. Studying these languages is useful in establishing the computational and expressive power of quantum machines in general.  ... 
doi:10.1007/978-3-030-50433-5_34 fatcat:s3ji4xq7hzgbtpu2vhkp3duxue

Recursive Double-Size Fixed Precision Arithmetic [chapter]

Alexis Breust, Christophe Chabot, Jean-Guillaume Dumas, Laurent Fousse, Pascal Giorgi
2016 Lecture Notes in Computer Science  
Preliminary experiments show that good performance can be attained when comparing to the state of art GMP library: it can be several order of magnitude faster when used with very few machine words.  ...  The main target precision is for cryptographic sizes, that is up to several tens of machine words.  ...  Introduction Mathematical computations that needs integers above machine word precision are compelled to rely on a third party library.  ... 
doi:10.1007/978-3-319-42432-3_28 fatcat:6bw7hadzd5c2jkidqh6idlmn5q

Page 406 of Communications of the Association for Computing Machinery Vol. 4, Issue 9 [page]

1961 Communications of the Association for Computing Machinery  
Items are useful in specifying and processing data which are packed in machine words. $+. Mera contains a Compoou facility which is a library of symbol, item and macro definitions.  ...  University of Reported by: Descriptors: learning theory, machine adaptive systems Effective analysis and synthesis procedures for fixed automata, growing automata, and Turing machines are being sought  ... 

Automata theory

Richard Laing
1961 Communications of the ACM  
Items are useful in specifying and processing data which are packed in machine words. $+. Mera contains a Compoou facility which is a library of symbol, item and macro definitions.  ...  University of Reported by: Descriptors: learning theory, machine adaptive systems Effective analysis and synthesis procedures for fixed automata, growing automata, and Turing machines are being sought  ... 
doi:10.1145/366696.366783 fatcat:5qidrhokhjb6fi63dxg43xqwpa
« Previous Showing results 1 — 15 out of 47,615 results