Decidable problems for powerful programs
Journal of the ACM (JACM)
On design principles for a molecular computer
Communications of the ACM
Expert systems: perils and promise
Communications of the ACM
The halting problem for Turning machines
ACM SIGACT News
ACM SIGACT News
Infinitesimal perturbation analysis for general discrete event systems
Journal of the ACM (JACM)
ACM SIGACT News
The infinite state acceptor and its application to AI
ACM SIGART Bulletin
A note on Cohen's formal model for computer viruses
ACM SIGSAC Review
Efficient simulation of finite automata by neural nets
Journal of the ACM (JACM)
Theory of computation: how to start
ACM SIGACT News
On the computational power of neural nets
COLT '92 Proceedings of the fifth annual workshop on Computational learning theory
Spatial machines: a more realistic approach to parallel computation
Communications of the ACM
On the power of sigmoid neural networks
COLT '93 Proceedings of the sixth annual conference on Computational learning theory
Constructing deterministic finite-state automata in recurrent neural networks
Journal of the ACM (JACM)
On the effect of analog noise in discrete-time analog computations
Neural Computation
Undecidability on quantum finite automata
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Compass permits leader election
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Theseus—a programming language for relational databeses
ACM Transactions on Database Systems (TODS)
Computational Complexity and Probability Constructions
Journal of the ACM (JACM)
The Equivalence Problem of Simple Programs
Journal of the ACM (JACM)
Simple Computation-Universal Cellular Spaces
Journal of the ACM (JACM)
Subrecursive Programming Languages, Part I: efficiency and program structure
Journal of the ACM (JACM)
Information-Theoretic Limitations of Formal Systems
Journal of the ACM (JACM)
A Theory of Program Size Formally Identical to Information Theory
Journal of the ACM (JACM)
The Complexity of Finite Memory Programs with Recursion
Journal of the ACM (JACM)
Fixed Point Languages, Equality Languages, and Representation of Recursively Enumerable Languages
Journal of the ACM (JACM)
On the Simplification and Equivalence Problems for Straight-Line Programs
Journal of the ACM (JACM)
SIGCSE '90 Proceedings of the twenty-first SIGCSE technical symposium on Computer science education
The millionth computer program
SIGCSE '90 Proceedings of the twenty-first SIGCSE technical symposium on Computer science education
On the expressive power of a language for programming coordination media
SAC '98 Proceedings of the 1998 ACM symposium on Applied Computing
SAC '00 Proceedings of the 2000 ACM symposium on Applied computing - Volume 1
What Machines Can and Cannot Do
ACM Computing Surveys (CSUR)
ACM Computing Surveys (CSUR)
Associons: A Program Notation with Tuples Instead of Variables
ACM Transactions on Programming Languages and Systems (TOPLAS)
Design of a LISP-based microprocessor
Communications of the ACM
Certification of programs for secure information flow
Communications of the ACM
A lattice model of secure information flow
Communications of the ACM
The new math of computer programming
Communications of the ACM
A computer science course program for small colleges
Communications of the ACM
Inductive methods for proving properties of programs
Communications of the ACM
Computer science: a conceptual framework for curriculum planning
Communications of the ACM
Automata, formal languages abstract switching, and computability in a Ph.D. computer science program
Communications of the ACM
John von Neumann and the evolutionary growth of complexity: looking backward, looking forward …
Artificial Life - Special issue on the Artificial Life VII: looking backward, looking forward
On optimal slicing of parallel programs
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
The programming languages REC and convert
ACM SIGPLAN Notices
Register-machine based processes
Journal of the ACM (JACM)
Even simple programs are hard to analyze
POPL '75 Proceedings of the 2nd ACM SIGACT-SIGPLAN symposium on Principles of programming languages
An algebraic model for string patterns
POPL '75 Proceedings of the 2nd ACM SIGACT-SIGPLAN symposium on Principles of programming languages
The wake up and report problem is time-equivalent to the firing squad synchronization problem
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
SIGGRAPH '76 Proceedings of the 3rd annual conference on Computer graphics and interactive techniques
Simulation preorder over simple process algebras
Information and Computation
Program logic without binding is decidable
POPL '81 Proceedings of the 8th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
The undecidability of the first-order theories of one step rewriting in linear canonical systems
Information and Computation
Smaller solutions for the firing squad
Theoretical Computer Science
A simple hardware model of a Turing machine: its educational use
ACM '72 Proceedings of the ACM annual conference - Volume 1
Analysis issues in Petri nets with inhibitor arcs
Theoretical Computer Science
Reconnaissance parallèle des langages rationnels sur automates cellulaires plans
Theoretical Computer Science
Indistinguishability of Finite-State Automata with Respect to Some Environments
Cybernetics and Systems Analysis
Journal of Automated Reasoning
Language of Thought: The Connectionist Contribution
Minds and Machines
Minds and Machines
Recipes, Algorithms, and Programs
Minds and Machines
Minds and Machines
Reflections on Gödel's and Gandy's Reflections on Turing's Thesis
Minds and Machines
The Scope of Turing's Analysis of Effective Procedures
Minds and Machines
Minds and Machines
On the Relationship between Foundations of Programming and Mathematics
Programming and Computing Software
Ansatz for dynamical hierarchies
Artificial Life
Deciding the confluence of ordered term rewrite systems
ACM Transactions on Computational Logic (TOCL)
Shared Memory Multimicroprocessor Operating System with an Extended Petri Net Model
IEEE Transactions on Parallel and Distributed Systems
Self-describing Turing machines
Fundamenta Informaticae
UPSILON: universal programming system with incomplete lazy object notation
Fundamenta Informaticae
GP Systems with forbidding context
Fundamenta Informaticae - Membrane computing
Computational complexity of neural networks: a survey
Nordic Journal of Computing
Artificial Intelligence Review
Finite-state computation in analog neural networks: steps towards biologically plausible models?
Emergent neural computational architectures based on neuroscience
Computing inside the billiard ball model
Collision-based computing
Universal computing in reversible and number-conserving two-dimensional cellular spaces
Collision-based computing
Turing universality of the game of life
Collision-based computing
On the Expressiveness of Event Notification in Data-Driven Coordination Languages
ESOP '00 Proceedings of the 9th European Symposium on Programming Languages and Systems
Expressiveness Issues and Decision Problems for Active Database Event Queries
ICDT '01 Proceedings of the 8th International Conference on Database Theory
An Embryonics Implementation of a Self-Replicating Universal Turing Machine
ICES '01 Proceedings of the 4th International Conference on Evolvable Systems: From Biology to Hardware
Determination of the Topology of a Directed Network
IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium
LPAR '02 Proceedings of the 9th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
Reformulation and Approximation in Model Checking
SARA '02 Proceedings of the 4th International Symposium on Abstraction, Reformulation, and Approximation
Simulation Preorder on Simple Process Algebras
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
The Quest for Small Universal Cellular Automata
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
An Artificial Economy of Post Production Systems
IWLCS '00 Revised Papers from the Third International Workshop on Advances in Learning Classifier Systems
Verification of Embedded Reactive Fiffo Systems
LATIN '02 Proceedings of the 5th Latin American Symposium on Theoretical Informatics
Symbolic Representation of Upward-Closed Sets
TACAS '00 Proceedings of the 6th International Conference on Tools and Algorithms for Construction and Analysis of Systems: Held as Part of the European Joint Conferences on the Theory and Practice of Software, ETAPS 2000
New Results on Alternating and Non-deterministic Two-Dimensional Finite-State Automata
STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
Techniques for Decidability and Undecidability of Bisimilarity
CONCUR '99 Proceedings of the 10th International Conference on Concurrency Theory
An Algebraic Characterization of Data and Timed Languages
CONCUR '01 Proceedings of the 12th International Conference on Concurrency Theory
Undecidability of Weak Bisimilarity for Pushdown Processes
CONCUR '02 Proceedings of the 13th International Conference on Concurrency Theory
Widening the Boundary between Decidable and Undecidable Hybrid Systems
CONCUR '02 Proceedings of the 13th International Conference on Concurrency Theory
A New Class of Symbolic Abstract Neural Nets: Tissue P Systems
COCOON '02 Proceedings of the 8th Annual International Conference on Computing and Combinatorics
Evolving Turing Machines for Biosequence Recognition and Analysis
EuroGP '01 Proceedings of the 4th European Conference on Genetic Programming
Temporary Data in Shared Dataspace Coordination Languages
FoSSaCS '01 Proceedings of the 4th International Conference on Foundations of Software Science and Computation Structures
Simulation Problems for One-Counter Machines
SOFSEM '99 Proceedings of the 26th Conference on Current Trends in Theory and Practice of Informatics on Theory and Practice of Informatics
Distributed Simulation with Cellular Automata: Architecture and Applications
SOFSEM '99 Proceedings of the 26th Conference on Current Trends in Theory and Practice of Informatics on Theory and Practice of Informatics
Equivalence-Checking with Infinite-State Systems: Techniques and Results
SOFSEM '02 Proceedings of the 29th Conference on Current Trends in Theory and Practice of Informatics: Theory and Practice of Informatics
SOFSEM '02 Proceedings of the 29th Conference on Current Trends in Theory and Practice of Informatics: Theory and Practice of Informatics
UMC '02 Proceedings of the Third International Conference on Unconventional Models of Computation
A Man and His Computer: An Issue of Adaptive Fitness and Personal Satisfaction
UMC '02 Proceedings of the Third International Conference on Unconventional Models of Computation
Membrane Computing: When Communication Is Enough
UMC '02 Proceedings of the Third International Conference on Unconventional Models of Computation
ACRI '01 Proceedings of the 5th International Conference on Cellular Automata for Research and Industry
P Systems with Activated/Prohibited Membrane Channels
WMC-CdeA '02 Revised Papers from the International Workshop on Membrane Computing
Membrane Systems with Symport/Antiport Rules: Universality Results
WMC-CdeA '02 Revised Papers from the International Workshop on Membrane Computing
Towards a Hierarchy of Conformons-P Systems
WMC-CdeA '02 Revised Papers from the International Workshop on Membrane Computing
P Systems without Priorities Are Computationally Universal
WMC-CdeA '02 Revised Papers from the International Workshop on Membrane Computing
Finite-State Computation in Analog Neural Networks: Steps towards Biologically Plausible Models?
Emergent Neural Computational Architectures Based on Neuroscience - Towards Neuroscience-Inspired Computing
Programmed Mutagenesis Is a Universal Model of Computation
DNA 7 Revised Papers from the 7th International Workshop on DNA-Based Computers: DNA Computing
A Universal Time-Varying Distributed H System of Degree 1
DNA 7 Revised Papers from the 7th International Workshop on DNA-Based Computers: DNA Computing
DNA8 Revised Papers from the 8th International Workshop on DNA Based Computers: DNA Computing
Proceedings of the 14th Annual Conference of the EACSL on Computer Science Logic
FCT '01 Proceedings of the 13th International Symposium on Fundamentals of Computation Theory
New Small Universal Circular Post Machines
FCT '01 Proceedings of the 13th International Symposium on Fundamentals of Computation Theory
On the Number of Non-terminal Symbols in Graph-Controlled, Programmed and Matrix Grammars
MCU '01 Proceedings of the Third International Conference on Machines, Computations, and Universality
On the Computational Power of a Continuous-Space Optical Model of Computation
MCU '01 Proceedings of the Third International Conference on Machines, Computations, and Universality
Three Small Universal Turing Machines
MCU '01 Proceedings of the Third International Conference on Machines, Computations, and Universality
Theoretical Computer Science
A universal cellular automaton in the hyperbolic plane
Theoretical Computer Science
Undecidable problems in unreliable computations
Theoretical Computer Science - Latin American theoretical informatics
Expired data collection in shared dataspaces
Theoretical Computer Science - Foundations of software science and computation structures
An algebraic approach to data languages and timed languages
Information and Computation
Theoretical Computer Science
How to reuse a "write - once " memory (Preliminary Version)
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
A course in computer structures
ISCA '76 Proceedings of the 3rd annual symposium on Computer architecture
Data type specification: Parameterization and the power of specification techniques
STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
The complexity of the equivalence problem for straight-line programs
STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing
STOC '72 Proceedings of the fourth annual ACM symposium on Theory of computing
Predecessor machines and regressing functions
STOC '72 Proceedings of the fourth annual ACM symposium on Theory of computing
STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
Teaching a topic in cybernetics with APL: An introduction to neural net modelling
APL '81 Proceedings of the international conference on APL
The impact of a computers and society course on student perspectives
ACM '73 Proceedings of the ACM annual conference
Programming with(out) the GOTO
ACM '72 Proceedings of the ACM annual conference - Volume 2
Control requirements for the design of production system architectures
Proceedings of the 1977 symposium on Artificial intelligence and programming languages
Inductive methods for proving properties of programs
Proceedings of ACM conference on Proving assertions about programs
Decision problems in computational models
Proceedings of ACM conference on Proving assertions about programs
STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
Computer science education in small colleges - a report with recommendations
SIGUCCS '72 Proceedings of the annual ACM SIGUCCS symposium on The administration and management of small-college computing centers
An introductory adaptive systems course for undergraduate computer science majors
SIGCSE '74 Proceedings of the fourth SIGCSE technical symposium on Computer science education
A course on the Relationship of Formal Language Theory to Automata
SIGCSE '70 Proceedings of the first SIGCSE technical symposium on Education in computer science
GULP—A compiler-compiler for verbal and graphic languages
ACM '68 Proceedings of the 1968 23rd ACM national conference
WSC '74 Proceedings of the 7th conference on Winter simulation - Volume 2
POPL '76 Proceedings of the 3rd ACM SIGACT-SIGPLAN symposium on Principles on programming languages
Pushdown timed automata: a binary reachability characterization and safety verification
Theoretical Computer Science
A course on the relationship of formal language theory to automata
ACM SIGCSE Bulletin
Proceedings of the fourteenth ACM conference on Hypertext and hypermedia
Undecidability of domino games and hhp-bisimilarity
Information and Computation
Watson-Crick D0L systems: generative power and undecidable problems
Theoretical Computer Science
On a finite axiomatization of the data type L
ACM SIGPLAN Notices
Determination of the topology of a directed network
Information Processing Letters
Modeling the adaptive visual system: a survey of principled approaches
Neural Networks - Special issue: Neuroinformatics
Branching time and orthogonal bisimulation equivalence
Theoretical Computer Science
Journal of the American Society for Information Science and Technology
From regulated rewriting to computing with membranes: collapsing hierarchies
Theoretical Computer Science
The conformon-P system: a molecular and cell biology-inspired computability model
Theoretical Computer Science
Defining natural language grammars in GPSG
ACL '86 Proceedings of the 24th annual meeting on Association for Computational Linguistics
Computational structure of generative phonology and its relation to language comprehension
ACL '90 Proceedings of the 28th annual meeting on Association for Computational Linguistics
Programming with(out) the GOTO
ACM SIGPLAN Notices - Special issue on control structures in programming languages
Proposal for a categorical programming language
ACM SIGPLAN Notices
Abstraction of assembler programs for symbolic worst case execution time analysis
Proceedings of the 41st annual Design Automation Conference
On teaching theoretical foundations of Computer Science
ACM SIGACT News
The modal argument for hypercomputing minds
Theoretical Computer Science - Super-recursive algorithms and hypercomputation
Computation in networks of passively mobile finite-state sensors
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Five big questions with pretty simple answers
IBM Journal of Research and Development
Self-organization in sensor networks
Journal of Parallel and Distributed Computing
Theoretical Computer Science
On the expressive power of movement and restriction in pure mobile ambients
Theoretical Computer Science - Special issue: Foundations of wide area network computing
Results on catalytic and evolution-communication P systems
New Generation Computing - Membrane computing
Small turing machines and generalized busy beaver competition
Theoretical Computer Science
Unification Modulo ACUI Plus Distributivity Axioms
Journal of Automated Reasoning
A preliminary survey of artificial intelligence machines
ACM SIGART Bulletin
On the computational strength of pure ambient calculi
Theoretical Computer Science - Expressiveness in concurrency
Computationally universal P systems without priorities: two catalysts are sufficient
Theoretical Computer Science - Descriptional complexity of formal systems
Tissue P systems with channel states
Theoretical Computer Science - Insightful theory
Closure properties and decision problems of dag automata
Information Processing Letters
Functions with local state: regularity and undecidability
Theoretical Computer Science
The impact of complexity theory on algorithms for sparse polynomials
ACM SIGSAM Bulletin
About the undecidability of program equivalence in finitary languages with state
ACM Transactions on Computational Logic (TOCL)
The procedural approach to interactive design graphics
ACM SIGGRAPH Computer Graphics
A structural approach to reversible computation
Theoretical Computer Science
Quantitative information in the tuple space coordination model
Theoretical Computer Science - Quantitative aspects of programming languages (QAPL 2004)
P systems with conditional communication rules assigned to membranes
Journal of Automata, Languages and Combinatorics
Syntactic control of concurrency
Theoretical Computer Science - Automata, languages and programming: Logic and semantics (ICALP-B 2004)
Improved undecidability results on weighted timed automata
Information Processing Letters
Comprehending software correctness implies comprehending an intelligence-related limitation
ACM Transactions on Computational Logic (TOCL)
Theoretical Computer Science - In honour of Professor Christian Choffrut on the occasion of his 60th birthday
Theoretical Computer Science - In honour of Professor Christian Choffrut on the occasion of his 60th birthday
Computation in networks of passively mobile finite-state sensors
Distributed Computing - Special issue: PODC 04
Boundedness undecidability for synchronized nets
Information Processing Letters
Theoretical Computer Science
New Generation Computing
Theoretical Computer Science
Construction universality in purely asynchronous cellular automata
Journal of Computer and System Sciences
Time and Synchronization in Membrane Systems
Fundamenta Informaticae - Contagious Creativity - In Honor of the 80th Birthday of Professor Solomon Marcus
Time-Varying Distributed H Systems: An Overview
Fundamenta Informaticae - Contagious Creativity - In Honor of the 80th Birthday of Professor Solomon Marcus
Symport/Antiport P Systems with Three Objects Are Universal
Fundamenta Informaticae - Contagious Creativity - In Honor of the 80th Birthday of Professor Solomon Marcus
Fundamenta Informaticae
Using well-structured transition systems to decide divergence for catalytic P systems
Theoretical Computer Science
On small universal antiport P systems
Theoretical Computer Science
Normal forms for spiking neural P systems
Theoretical Computer Science
Three "quantum" algorithms to solve 3-SAT
Theoretical Computer Science
Analogies between linguistics and information theory: Research Articles
Journal of the American Society for Information Science and Technology
P Systems with Proteins on Membranes
Fundamenta Informaticae
On the Branching Complexity of P Systems
Fundamenta Informaticae - SPECIAL ISSUE ON TRAJECTORIES OF LANGUAGE THEORY Dedicated to the memory of Alexandru Mateescu
(Tissue) P Systems with Unit Rules and Energy Assigned to Membranes
Fundamenta Informaticae - SPECIAL ISSUE MCU2004
Abstract Geometrical Computation 1: Embedding Black Hole Computations with Rational Numbers
Fundamenta Informaticae - SPECIAL ISSUE MCU2004
Variable Complexity of Simple Programs
Fundamenta Informaticae - SPECIAL ISSUE MCU2004
Fundamenta Informaticae - SPECIAL ISSUE MCU2004
On String Languages Generated by Spiking Neural P Systems
Fundamenta Informaticae - New Frontiers in Scientific Discovery - Commemorating the Life and Work of Zdzislaw Pawlak
Robust parametric reachability for timed automata
Information Processing Letters
Selection power and selection labor for information retrieval
Journal of the American Society for Information Science and Technology
P systems with minimal parallelism
Theoretical Computer Science
Tissue P Systems and (Mem)Brane Systems with Mate and Drip Operations Working on Strings
Electronic Notes in Theoretical Computer Science (ENTCS)
A single-copy minimal-time simulation of a torus of automata by a ring of automata
Discrete Applied Mathematics
Speeding up the Synthesis of Programs from Traces
IEEE Transactions on Computers
B70-5 Theories of Abstract Automata
IEEE Transactions on Computers
A Universal Four-State Cellular Computer
IEEE Transactions on Computers
Tag systems and Collatz-like functions
Theoretical Computer Science
A labor theoretic approach to information retrieval
Journal of the American Society for Information Science and Technology
Decidability and syntactic control of interference
Theoretical Computer Science
Minimality considerations for ordinal computers modeling constructibility
Theoretical Computer Science
Reversible computing and cellular automata—A survey
Theoretical Computer Science
The computational power of discrete hopfield nets with hidden units
Neural Computation
Editing Configurations of P Systems
Fundamenta Informaticae
Spiking neural P systems with extended rules: universality and languages
Natural Computing: an international journal
Static analysis of active XML systems
Proceedings of the twenty-seventh ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
A 4-states algebraic solution to linear cellular automata synchronization
Information Processing Letters
Information Processing Letters
Proceedings of the 10th international ACM SIGPLAN conference on Principles and practice of declarative programming
Verification of well-formed communicating recursive state machines
Theoretical Computer Science
Generalized communicating P systems
Theoretical Computer Science
CiE '07 Proceedings of the 3rd conference on Computability in Europe: Computation and Logic in the Real World
On the Computational Power of Flip-Flop Proteins on Membranes
CiE '07 Proceedings of the 3rd conference on Computability in Europe: Computation and Logic in the Real World
The Underlying Formal Model of Algorithmic Lateral Inhibition in Motion Detection
IWINAC '07 Proceedings of the 2nd international work-conference on Nature Inspired Problem-Solving Methods in Knowledge Engineering: Interplay Between Natural and Artificial Computation, Part II
Updatable Timed Automata with Additive and Diagonal Constraints
CiE '08 Proceedings of the 4th conference on Computability in Europe: Logic and Theory of Algorithms
Design, Implementation and Deployment of State Machines Using a Generative Approach
Architecting Dependable Systems V
On the Computational Power of Biochemistry
AB '08 Proceedings of the 3rd international conference on Algebraic Biology
Reversal-Bounded Counter Machines Revisited
MFCS '08 Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science
Periodicity and Immortality in Reversible Computing
MFCS '08 Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science
About 4-States Solutions to the Firing Squad Synchronization Problem
ACRI '08 Proceedings of the 8th international conference on Cellular Automata for Reseach and Industry
Quantitative Separation Logic and Programs with Lists
IJCAR '08 Proceedings of the 4th international joint conference on Automated Reasoning
Termination Problems in Chemical Kinetics
CONCUR '08 Proceedings of the 19th international conference on Concurrency Theory
Back to the Complexity of Universal Programs
CP '08 Proceedings of the 14th international conference on Principles and Practice of Constraint Programming
The Expressiveness of Concentration Controlled P Systems
UC '08 Proceedings of the 7th international conference on Unconventional Computing
Verification of qualitative Z constraints
Theoretical Computer Science
Associative Learning on a Continuum in Evolved Dynamical Neural Networks
Adaptive Behavior - Animals, Animats, Software Agents, Robots, Adaptive Systems
Hypercomputation, Unconsciousness and Entertainment Technology
Proceedings of the 2nd International Conference on Fun and Games
Refining the nonterminal complexity of graph-controlled, programmed, and matrix grammars
Journal of Automata, Languages and Combinatorics
Theoretical Computer Science
On the power of elementary features in spiking neural P systems
Natural Computing: an international journal
On string languages generated by spiking neural P systems with exhaustive use of rules
Natural Computing: an international journal
Experiments on the reliability of stochastic spiking neural P systems
Natural Computing: an international journal
Some logical and numerical aspects of pattern recognition and artificial intelligence
AFIPS '69 (Spring) Proceedings of the May 14-16, 1969, spring joint computer conference
Operating systems principles and undergraduate computer science curricula
AFIPS '72 (Spring) Proceedings of the May 16-18, 1972, spring joint computer conference
Theory of computing in computer science education
AFIPS '72 (Spring) Proceedings of the May 16-18, 1972, spring joint computer conference
Reachability in Petri Nets with Inhibitor Arcs
Electronic Notes in Theoretical Computer Science (ENTCS)
Verifying liveness for asynchronous programs
Proceedings of the 36th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Surprising Areas in the Quest for Small Universal Devices
Electronic Notes in Theoretical Computer Science (ENTCS)
Electronic Notes in Theoretical Computer Science (ENTCS)
Smaller Universal Spiking Neural P Systems
Fundamenta Informaticae
Computational expressiveness of Genetic Systems
Theoretical Computer Science
Turing-Complete Subclasses of CHR
ICLP '08 Proceedings of the 24th International Conference on Logic Programming
Fast Synchronization in P Systems
Membrane Computing
First Steps Towards a Wet Implementation for τ -DPP
Membrane Computing
Expressiveness of Multiple Heads in CHR
SOFSEM '09 Proceedings of the 35th Conference on Current Trends in Theory and Practice of Computer Science
LTL with the freeze quantifier and register automata
ACM Transactions on Computational Logic (TOCL)
State-dependent computation using coupled recurrent networks
Neural Computation
Regular production systems and triangle tilings
Theoretical Computer Science
On Trace-Expressible Behaviour of Petri Nets
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
Group-Linking Method: A Unified Benchmark for Machine Learning with Recurrent Neural Network
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
On the Expressive Power of Restriction and Priorities in CCS with Replication
FOSSACS '09 Proceedings of the 12th International Conference on Foundations of Software Science and Computational Structures: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009
TACAS '09 Proceedings of the 15th International Conference on Tools and Algorithms for the Construction and Analysis of Systems: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009,
On the Expressive Power of Process Interruption and Compensation
Web Services and Formal Methods
Asynchronous spiking neural P systems
Theoretical Computer Science
Note: Automata on the plane vs particles and collisions
Theoretical Computer Science
On languages generated by asynchronous spiking neural P systems
Theoretical Computer Science
Undecidable equivalences for basic parallel processes
Information and Computation
Flat Parametric Counter Automata
Fundamenta Informaticae - Machines, Computations and Universality, Part II
On the Computational Power of Querying the History
Fundamenta Informaticae - Machines, Computations and Universality, Part II
Partial Halting and Minimal Parallelism Based on Arbitrary Rule Partitions
Fundamenta Informaticae - Machines, Computations and Universality, Part I
Four Small Universal Turing Machines
Fundamenta Informaticae - Machines, Computations and Universality, Part I
Fundamenta Informaticae - Machines, Computations and Universality, Part I
On the expressive power of process interruption and compensation
Mathematical Structures in Computer Science
Reachability in Timed Counter Systems
Electronic Notes in Theoretical Computer Science (ENTCS)
Undecidability of Cost-Bounded Reachability in Priced Probabilistic Timed Automata
TAMC '09 Proceedings of the 6th Annual Conference on Theory and Applications of Models of Computation
Decidable Fragments of a Higher Order Calculus with Locations
Electronic Notes in Theoretical Computer Science (ENTCS)
Sequential SNP systems based on min/max spike number
Theoretical Computer Science
NSP: a Neuro---Symbolic Processor
IWANN '03 Proceedings of the 7th International Work-Conference on Artificial and Natural Neural Networks: Part II: Artificial Neural Nets Problem Solving Methods
Reachability in Stochastic Timed Games
ICALP '09 Proceedings of the 36th Internatilonal Collogquium on Automata, Languages and Programming: Part II
The concept of nondeterminism: its development and implications for teaching
ACM SIGCSE Bulletin
Fundamenta Informaticae
Representing Logical Inference Steps with Digital Circuits
Proceedings of the Symposium on Human Interface 2009 on Human Interface and the Management of Information. Information and Interaction. Part II: Held as part of HCI International 2009
On the Relationship between η-Calculus and Finite Place/Transition Petri Nets
CONCUR 2009 Proceedings of the 20th International Conference on Concurrency Theory
Weak Time Petri Nets Strike Back!
CONCUR 2009 Proceedings of the 20th International Conference on Concurrency Theory
Turing Completeness Using Three Mobile Membranes
UC '09 Proceedings of the 8th International Conference on Unconventional Computation
Analyzing Real-Time Event-Driven Programs
FORMATS '09 Proceedings of the 7th International Conference on Formal Modeling and Analysis of Timed Systems
The Reachability Problem over Infinite Graphs
CSR '09 Proceedings of the Fourth International Computer Science Symposium in Russia on Computer Science - Theory and Applications
On the Expressiveness of Forwarding in Higher-Order Communication
ICTAC '09 Proceedings of the 6th International Colloquium on Theoretical Aspects of Computing
Quantitative Pathway Logic for Computational Biology
CMSB '09 Proceedings of the 7th International Conference on Computational Methods in Systems Biology
The κ-Lattice: Decidability Boundaries for Qualitative Analysis in Biological Languages
CMSB '09 Proceedings of the 7th International Conference on Computational Methods in Systems Biology
Static analysis of active XML systems
ACM Transactions on Database Systems (TODS)
Simulation of generalized synchronization processes on one-dimensional cellular automata
SMO'09 Proceedings of the 9th WSEAS international conference on Simulation, modelling and optimization
On the computational power of BlenX
Theoretical Computer Science
Logical reversibility of computation
IBM Journal of Research and Development
Selection for wandering behavior in a small robot
Artificial Life
Mixing Coverability and Reachability to Analyze VASS with One Zero-Test
SOFSEM '10 Proceedings of the 36th Conference on Current Trends in Theory and Practice of Computer Science
Polymorphic Systems with Arrays, 2-Counter Machines and Multiset Rewriting
Electronic Notes in Theoretical Computer Science (ENTCS)
Games for Counting Abstractions
Electronic Notes in Theoretical Computer Science (ENTCS)
Reconfigurable asynchronous logic automata: (RALA)
Proceedings of the 37th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Refining the Undecidability Border of Weak Bisimilarity
Electronic Notes in Theoretical Computer Science (ENTCS)
The problem of space invariance for sequential machines
Information and Computation
Closure properties and decision problems of dag automata
Information Processing Letters
Improved undecidability results on weighted timed automata
Information Processing Letters
Approximation and complexity of functions on the integers
Information Sciences: an International Journal
New directions in fuzzy automata
International Journal of Approximate Reasoning
Real-time motion detection by lateral inhibition in accumulative computation
Engineering Applications of Artificial Intelligence
(tissue) p systems with cell polarity
Mathematical Structures in Computer Science
An expressiveness study of priority in process calculi
Mathematical Structures in Computer Science
On the expressive power of recursion, replication and iteration in process calculi
Mathematical Structures in Computer Science
Deciding reachability problems in turing-complete fragments of mobile ambients
Mathematical Structures in Computer Science
Homogeneous Spiking Neural P Systems
Fundamenta Informaticae
Journal of Computer and System Sciences
The constructibility of a configuration in a cellular automaton
Journal of Computer and System Sciences
Deterministic one-counter automata
Journal of Computer and System Sciences
Towards a theory of data structures
Journal of Computer and System Sciences
Journal of Computer and System Sciences
Indistinguishable from Magic: Computation is Cognitive Technology
Minds and Machines
On three classes of automata-like P systems
DLT'03 Proceedings of the 7th international conference on Developments in language theory
Undecidability of weak bisimulation equivalence for 1-counter processes
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
ISPA'03 Proceedings of the 2003 international conference on Parallel and distributed processing and applications
A synchronization problem on 1-bit communication cellular automata
ICCS'03 Proceedings of the 1st international conference on Computational science: PartI
DLT'07 Proceedings of the 11th international conference on Developments in language theory
Model checking memoryful linear-time logics over one-counter automata
Theoretical Computer Science
A universal reversible turing machine
MCU'07 Proceedings of the 5th international conference on Machines, computations, and universality
Partial halting in P systems using membrane rules with permitting contexts
MCU'07 Proceedings of the 5th international conference on Machines, computations, and universality
Four small universal turing machines
MCU'07 Proceedings of the 5th international conference on Machines, computations, and universality
A smallest five-state solution to the firing squad synchronization problem
MCU'07 Proceedings of the 5th international conference on Machines, computations, and universality
MCU'07 Proceedings of the 5th international conference on Machines, computations, and universality
(UREM) P systems with a quantum-like behavior: background, definition, and computational power
WMC'07 Proceedings of the 8th international conference on Membrane computing
Skin output in P systems with minimal symport/antiport and two membranes
WMC'07 Proceedings of the 8th international conference on Membrane computing
On the number of agents in P colonies
WMC'07 Proceedings of the 8th international conference on Membrane computing
On the dynamics of PB systems with volatile membranes
WMC'07 Proceedings of the 8th international conference on Membrane computing
Conformon-P systems with negative values
WMC'07 Proceedings of the 8th international conference on Membrane computing
On flip-flop membrane systems with proteins
WMC'07 Proceedings of the 8th international conference on Membrane computing
EPIA'07 Proceedings of the aritficial intelligence 13th Portuguese conference on Progress in artificial intelligence
CCS with replication in the Chomsky hierarchy: the expressive power of divergence
APLAS'07 Proceedings of the 5th Asian conference on Programming languages and systems
Periodic and infinite traces in matrix semigroups
SOFSEM'08 Proceedings of the 34th conference on Current trends in theory and practice of computer science
Asynchronous spiking neural P systems: decidability and undecidability
DNA13'07 Proceedings of the 13th international conference on DNA computing
Verifying parametrised hardware designs via counter automata
HVC'07 Proceedings of the 3rd international Haifa verification conference on Hardware and software: verification and testing
What else is decidable about integer arrays?
FOSSACS'08/ETAPS'08 Proceedings of the Theory and practice of software, 11th international conference on Foundations of software science and computational structures
The church-turing thesis over arbitrary domains
Pillars of computer science
CSL'09/EACSL'09 Proceedings of the 23rd CSL international conference and 18th EACSL Annual conference on Computer science logic
The most general conservation law for a cellular automaton
CSR'08 Proceedings of the 3rd international conference on Computer science: theory and applications
Computing with energy and chemical reactions
Natural Computing: an international journal
Agent-oriented programming: from prolog to guarded definite clauses
Agent-oriented programming: from prolog to guarded definite clauses
Quantitative Separation Logic and Programs with Lists
Journal of Automated Reasoning
Challenge problems for artificial intelligence
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 2
Spiking neural p systems with weights
Neural Computation
Identification of finite state automata with a class of recurrent neural networks
IEEE Transactions on Neural Networks
Reachability games on extended vector addition systems with states
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming: Part II
The complexity of regular(-like) expressions
DLT'10 Proceedings of the 14th international conference on Developments in language theory
Algorithms and theory of computation handbook
Reversibility and determinism in sequential multiset rewriting
UC'10 Proceedings of the 9th international conference on Unconventional computation
Majority adder implementation by competing patterns in life-like rule B2/S2345
UC'10 Proceedings of the 9th international conference on Unconventional computation
The extended glider-eater machine in the spiral rule
UC'10 Proceedings of the 9th international conference on Unconventional computation
Energy and mean-payoff games with imperfect information
CSL'10/EACSL'10 Proceedings of the 24th international conference/19th annual conference on Computer science logic
Parameterized verification of ad hoc networks
CONCUR'10 Proceedings of the 21st international conference on Concurrency theory
Kleene, Rabin, and Scott are available
CONCUR'10 Proceedings of the 21st international conference on Concurrency theory
Communication complexity and intrinsic universality in cellular automata
Theoretical Computer Science
On the complex behavior of simple tag systems-An experimental approach
Theoretical Computer Science
On generalized communicating P systems with minimal interaction rules
Theoretical Computer Science
P systems with minimal insertion and deletion
Theoretical Computer Science
On the verification of membrane systems with dynamic structure
Natural Computing: an international journal
Programming in Biomolecular Computation
Electronic Notes in Theoretical Computer Science (ENTCS)
On the expressiveness and decidability of higher-order process calculi
Information and Computation
Storage capacity of labeled graphs
SSS'10 Proceedings of the 12th international conference on Stabilization, safety, and security of distributed systems
ATVA'10 Proceedings of the 8th international conference on Automated technology for verification and analysis
Artifact systems with data dependencies and arithmetic
Proceedings of the 14th International Conference on Database Theory
A small universal splicing P system
CMC'10 Proceedings of the 11th international conference on Membrane computing
On generalized communicating P systems with one symbol
CMC'10 Proceedings of the 11th international conference on Membrane computing
Computationally complete spiking neural P systems without delay: two types of neurons are enough
CMC'10 Proceedings of the 11th international conference on Membrane computing
CMC'10 Proceedings of the 11th international conference on Membrane computing
Verification of timed-arc Petri nets
SOFSEM'11 Proceedings of the 37th international conference on Current trends in theory and practice of computer science
Context modeling using RNN for keyword detection
ICASSP'93 Proceedings of the 1993 IEEE international conference on Acoustics, speech, and signal processing: plenary, special, audio, underwater acoustics, VLSI, neural networks - Volume I
Efficient turing-universal computation with DNA polymers
DNA'10 Proceedings of the 16th international conference on DNA computing and molecular programming
Minimization strategies for maximally parallel multiset rewriting systems
Theoretical Computer Science
P systems with active membranes: trading time for space
Natural Computing: an international journal
Time-free spiking neural p systems
Neural Computation
ICANN'05 Proceedings of the 15th international conference on Artificial neural networks: formal models and their applications - Volume Part II
On the power of cliques in the parameterized verification of Ad Hoc networks
FOSSACS'11/ETAPS'11 Proceedings of the 14th international conference on Foundations of software science and computational structures: part of the joint European conferences on theory and practice of software
Communication membrane systems with active symports
Journal of Automata, Languages and Combinatorics
Event-related outputs of computations in P systems
Journal of Automata, Languages and Combinatorics
Power and efficiency of minimal parallelism in polarizationless P systems
Journal of Automata, Languages and Combinatorics
A general framework for regulated rewriting based on the applicability of rules
Computation, cooperation, and life
P colonies and their extensions
Computation, cooperation, and life
Nanomachine computing by quorum sensing
Computation, cooperation, and life
Revisiting glue expressiveness in component-based systems
COORDINATION'11 Proceedings of the 13th international conference on Coordination models and languages
FMOODS'11/FORTE'11 Proceedings of the joint 13th IFIP WG 6.1 and 30th IFIP WG 6.1 international conference on Formal techniques for distributed systems
Planarity of knots, register automata and logspace computability
LATA'11 Proceedings of the 5th international conference on Language and automata theory and applications
On the interval-bound problem for weighted timed automata
LATA'11 Proceedings of the 5th international conference on Language and automata theory and applications
Hierarchy results on stateless multicounter 5′ → 3′ Watson-Crick automata
IWANN'11 Proceedings of the 11th international conference on Artificial neural networks conference on Advances in computational intelligence - Volume Part I
On reachability for hybrid automata over bounded time
ICALP'11 Proceedings of the 38th international conference on Automata, languages and programming - Volume Part II
On the number of components and clusters of non-returning parallel communicating grammar systems
DCFS'11 Proceedings of the 13th international conference on Descriptional complexity of formal systems
Energy games in multiweighted automata
ICTAC'11 Proceedings of the 8th international conference on Theoretical aspects of computing
Automatic verification of data-centric business processes
BPM'11 Proceedings of the 9th international conference on Business process management
Computability power of mobility in enhanced mobile membranes
CiE'11 Proceedings of the 7th conference on Models of computation in context: computability in Europe
PaCT'11 Proceedings of the 11th international conference on Parallel computing technologies
What's decidable about weighted automata?
ATVA'11 Proceedings of the 9th international conference on Automated technology for verification and analysis
On the Expressive Power of Multiple Heads in CHR
ACM Transactions on Computational Logic (TOCL)
Computational biology: a programming perspective
Formal modeling
Extended spiking neural p systems
WMC'06 Proceedings of the 7th international conference on Membrane Computing
Towards a characterization of p systems with minimal symport/antiport and two membranes
WMC'06 Proceedings of the 7th international conference on Membrane Computing
Computing with genetic gates, proteins, and membranes
WMC'06 Proceedings of the 7th international conference on Membrane Computing
P colonies with a bounded number of cells and programs
WMC'06 Proceedings of the 7th international conference on Membrane Computing
Infinite hierarchies of conformon-p systems
WMC'06 Proceedings of the 7th international conference on Membrane Computing
Characterizations of some restricted spiking neural p systems
WMC'06 Proceedings of the 7th international conference on Membrane Computing
Computational completeness of tissue p systems with conditional uniport
WMC'06 Proceedings of the 7th international conference on Membrane Computing
On spiking neural p systems and partially blind counter machines
UC'06 Proceedings of the 5th international conference on Unconventional Computation
UC'06 Proceedings of the 5th international conference on Unconventional Computation
On the power of bio-turing machines
UC'06 Proceedings of the 5th international conference on Unconventional Computation
Branching-time temporal logic extended with qualitative presburger constraints
LPAR'06 Proceedings of the 13th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
On decidability of LTL model checking for process rewrite systems
FSTTCS'06 Proceedings of the 26th international conference on Foundations of Software Technology and Theoretical Computer Science
On the complexity of the “most general” firing squad synchronization problem
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
Flat parametric counter automata
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part II
Reversible conservative rational abstract geometrical computation is turing-universal
CiE'06 Proceedings of the Second conference on Computability in Europe: logical Approaches to Computational Barriers
Upper and lower bounds for the computational power of p systems with mobile membranes
CiE'06 Proceedings of the Second conference on Computability in Europe: logical Approaches to Computational Barriers
UC'05 Proceedings of the 4th international conference on Unconventional Computation
Flat counter automata almost everywhere!
ATVA'05 Proceedings of the Third international conference on Automated Technology for Verification and Analysis
FORMATS'05 Proceedings of the Third international conference on Formal Modeling and Analysis of Timed Systems
Deciding behavioural properties in brane calculi
CMSB'06 Proceedings of the 2006 international conference on Computational Methods in Systems Biology
Computational power of symport/antiport: history, advances, and open problems
WMC'05 Proceedings of the 6th international conference on Membrane Computing
Number of protons/bi-stable catalysts and membranes in p systems. time-freeness
WMC'05 Proceedings of the 6th international conference on Membrane Computing
Symbol/Membrane complexity of p systems with symport/antiport rules
WMC'05 Proceedings of the 6th international conference on Membrane Computing
Encoding-Decoding transitional systems for classes of p systems
WMC'05 Proceedings of the 6th international conference on Membrane Computing
On the computational power of the mate/bud/drip brane calculus: interleaving vs. maximal parallelism
WMC'05 Proceedings of the 6th international conference on Membrane Computing
P systems, petri nets, and program machines
WMC'05 Proceedings of the 6th international conference on Membrane Computing
Quantum sequential p systems with unit rules and energy assigned to membranes
WMC'05 Proceedings of the 6th international conference on Membrane Computing
On the rule complexity of universal tissue p systems
WMC'05 Proceedings of the 6th international conference on Membrane Computing
Forecasting black holes in abstract geometrical computation is highly unpredictable
TAMC'06 Proceedings of the Third international conference on Theory and Applications of Models of Computation
Spiking Neural P Systems with Weighted Synapses
Neural Processing Letters
On the computational power of brane calculi
Transactions on Computational Systems Biology VI
Termination and divergence are undecidable under a maximum progress multi-step semantics for linca
ICTAC'06 Proceedings of the Third international conference on Theoretical Aspects of Computing
Computing with spiking neural p systems: traces and small universal systems
DNA'06 Proceedings of the 12th international conference on DNA Computing
Minimal parallelism for polarizationless p systems
DNA'06 Proceedings of the 12th international conference on DNA Computing
Tissue p systems with antiport rules and small numbers of symbols and cells
DLT'05 Proceedings of the 9th international conference on Developments in Language Theory
On language inequalities XK ⊆ LX
DLT'05 Proceedings of the 9th international conference on Developments in Language Theory
Low dimensional hybrid systems - decidable, undecidable, don't know
Information and Computation
UPP'04 Proceedings of the 2004 international conference on Unconventional Programming Paradigms
Fast computation by population protocols with a leader
DISC'06 Proceedings of the 20th international conference on Distributed Computing
Verifying the incorrectness of programs and automata
SARA'05 Proceedings of the 6th international conference on Abstraction, Reformulation and Approximation
On the decidability of temporal properties of probabilistic pushdown automata
STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
The power of commuting with finite sets of words
STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
Deciding reachability in mobile ambients
ESOP'05 Proceedings of the 14th European conference on Programming Languages and Systems
An associative cortical model of language understanding and action planning
IWINAC'05 Proceedings of the First international work-conference on the Interplay Between Natural and Artificial Computation conference on Artificial Intelligence and Knowledge Engineering Applications: a bioinspired approach - Volume Part II
MERIT: an interpolating model-checker
CAV'10 Proceedings of the 22nd international conference on Computer Aided Verification
Asynchronous p systems and p systems working in the sequential mode
WMC'04 Proceedings of the 5th international conference on Membrane Computing
Communicative p systems with minimal cooperation
WMC'04 Proceedings of the 5th international conference on Membrane Computing
Inhibiting/de-inhibiting rules in p systems
WMC'04 Proceedings of the 5th international conference on Membrane Computing
WMC'04 Proceedings of the 5th international conference on Membrane Computing
WMC'04 Proceedings of the 5th international conference on Membrane Computing
On the complexity of network synchronization
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
ACRI'06 Proceedings of the 7th international conference on Cellular Automata for Research and Industry
ACRI'06 Proceedings of the 7th international conference on Cellular Automata for Research and Industry
Model checking probabilistic systems against pushdown specifications
Information Processing Letters
Deciding safety properties in infinite-state pi-calculus via behavioural types
Information and Computation
On the complexity of universal programs
MCU'04 Proceedings of the 4th international conference on Machines, Computations, and Universality
Finite sets of words and computing
MCU'04 Proceedings of the 4th international conference on Machines, Computations, and Universality
Abstract geometrical computation for black hole computation
MCU'04 Proceedings of the 4th international conference on Machines, Computations, and Universality
MCU'04 Proceedings of the 4th international conference on Machines, Computations, and Universality
Sequential p systems with unit rules and energy assigned to membranes
MCU'04 Proceedings of the 4th international conference on Machines, Computations, and Universality
MCU'04 Proceedings of the 4th international conference on Machines, Computations, and Universality
Register complexity of LOOP-, WHILE-, and GOTO-Programs
MCU'04 Proceedings of the 4th international conference on Machines, Computations, and Universality
Prioritized and parallel reactions in shared data space coordination languages
COORDINATION'05 Proceedings of the 7th international conference on Coordination Models and Languages
Spiking neural p systems with astrocytes
Neural Computation
Implementation of catalytic p systems
CIAA'04 Proceedings of the 9th international conference on Implementation and Application of Automata
DLT'04 Proceedings of the 8th international conference on Developments in Language Theory
On the computation power of finite automata in two-dimensional environments
DLT'04 Proceedings of the 8th international conference on Developments in Language Theory
From post systems to the reachability problems for matrix semigroups and multicounter automata
DLT'04 Proceedings of the 8th international conference on Developments in Language Theory
Tissue p systems with minimal symport/antiport
DLT'04 Proceedings of the 8th international conference on Developments in Language Theory
Interrupt Timed Automata: verification and expressiveness
Formal Methods in System Design
Sequential and maximally parallel multiset rewriting: reversibility and determinism
Natural Computing: an international journal
Algorithmic verification of asynchronous programs
ACM Transactions on Programming Languages and Systems (TOPLAS)
Unions of equational monadic theories
RTA'06 Proceedings of the 17th international conference on Term Rewriting and Applications
Towards a model-checker for counter systems
ATVA'06 Proceedings of the 4th international conference on Automated Technology for Verification and Analysis
A hierarchical classification of first-order recurrent neural networks
LATA'10 Proceedings of the 4th international conference on Language and Automata Theory and Applications
P systems with proteins on membranes and membrane division
DLT'06 Proceedings of the 10th international conference on Developments in Language Theory
DLT'06 Proceedings of the 10th international conference on Developments in Language Theory
A survey on picture-walking automata
Algebraic Foundations in Computer Science
Energy-Based models of p systems
WMC'09 Proceedings of the 10th international conference on Membrane Computing
On reversibility and determinism in p systems
WMC'09 Proceedings of the 10th international conference on Membrane Computing
(Tissue) p systems with hybrid transition modes
WMC'09 Proceedings of the 10th international conference on Membrane Computing
A note on small universal spiking neural p systems
WMC'09 Proceedings of the 10th international conference on Membrane Computing
On the relationship between spatial logics and behavioral simulations
FOSSACS'10 Proceedings of the 13th international conference on Foundations of Software Science and Computational Structures
Untyped recursion schemes and infinite intersection types
FOSSACS'10 Proceedings of the 13th international conference on Foundations of Software Science and Computational Structures
Behavioural contracts with request-response operations
COORDINATION'10 Proceedings of the 12th international conference on Coordination Models and Languages
Abstract geometrical computation: turing-computing ability and undecidability
CiE'05 Proceedings of the First international conference on Computability in Europe: new Computational Paradigms
Hilbert's tenth problem and paradigms of computation
CiE'05 Proceedings of the First international conference on Computability in Europe: new Computational Paradigms
The development and writing of "process structuring"
Dependable and Historic Computing
The computational power of interactive recurrent neural networks
Neural Computation
Nash equilibrium in weighted concurrent timed games with reachability objectives
ICDCIT'12 Proceedings of the 8th international conference on Distributed Computing and Internet Technology
The complexity of small universal turing machines: a survey
SOFSEM'12 Proceedings of the 38th international conference on Current Trends in Theory and Practice of Computer Science
On the termination of integer loops
VMCAI'12 Proceedings of the 13th international conference on Verification, Model Checking, and Abstract Interpretation
Verification of gap-order constraint abstractions of counter systems
VMCAI'12 Proceedings of the 13th international conference on Verification, Model Checking, and Abstract Interpretation
Modularity in p colonies with checking rules
CMC'11 Proceedings of the 12th international conference on Membrane Computing
P systems with active membranes operating under minimal parallelism
CMC'11 Proceedings of the 12th international conference on Membrane Computing
Asynchronous extended spiking neural p systems with astrocytes
CMC'11 Proceedings of the 12th international conference on Membrane Computing
Computing with multi-membranes
CMC'11 Proceedings of the 12th international conference on Membrane Computing
Sequentiality induced by spike number in SNP systems: small universal machines
CMC'11 Proceedings of the 12th international conference on Membrane Computing
CMC'11 Proceedings of the 12th international conference on Membrane Computing
The expressive power of analog recurrent neural networks on infinite input streams
Theoretical Computer Science
Multiset rewriting for the verification of depth-bounded processes with name binding
Information and Computation
Model discrimination using an algorithmic information criterion
Automatica (Journal of IFAC)
Decidability of behavioral equivalences in process calculi with name scoping
FSEN'11 Proceedings of the 4th IPM international conference on Fundamentals of Software Engineering
A weakly universal spiking neural P system
Mathematical and Computer Modelling: An International Journal
Artifact systems with data dependencies and arithmetic
ACM Transactions on Database Systems (TODS)
HotPar'12 Proceedings of the 4th USENIX conference on Hot Topics in Parallelism
Taming past LTL and flat counter systems
IJCAR'12 Proceedings of the 6th international joint conference on Automated Reasoning
A Perfect Model for Bounded Verification
LICS '12 Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science
Fundamenta Informaticae
Hierarchies of Stateless Multicounter 5′ → 3′ Watson-Crick Automata Languages
Fundamenta Informaticae - Theory that Counts: To Oscar Ibarra on His 70th Birthday
Limited Asynchronous Spiking Neural P Systems
Fundamenta Informaticae - Theory that Counts: To Oscar Ibarra on His 70th Birthday
On Restricted Bio-Turing Machines
Fundamenta Informaticae - Theory that Counts: To Oscar Ibarra on His 70th Birthday
Universality of Splicing Test Tube Systems with Two Tubes
Fundamenta Informaticae - Theory that Counts: To Oscar Ibarra on His 70th Birthday
Partial Halting and Minimal Parallelism Based on Arbitrary Rule Partitions
Fundamenta Informaticae - Machines, Computations and Universality, Part I
Four Small Universal Turing Machines
Fundamenta Informaticae - Machines, Computations and Universality, Part I
Fundamenta Informaticae - Machines, Computations and Universality, Part I
Flat Parametric Counter Automata
Fundamenta Informaticae - Machines, Computations and Universality, Part II
On the Computational Power of Querying the History
Fundamenta Informaticae - Machines, Computations and Universality, Part II
Characterizing languages by normalization and termination in string rewriting
DLT'12 Proceedings of the 16th international conference on Developments in Language Theory
Fundamenta Informaticae
Homogeneous Spiking Neural P Systems
Fundamenta Informaticae
Editing Configurations of P Systems
Fundamenta Informaticae
On Trace-Expressible Behaviour of Petri Nets
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
Smaller Universal Spiking Neural P Systems
Fundamenta Informaticae
On String Languages Generated by Spiking Neural P Systems
Fundamenta Informaticae - New Frontiers in Scientific Discovery - Commemorating the Life and Work of Zdzislaw Pawlak
On immortal configurations in turing machines
CiE'12 Proceedings of the 8th Turing Centenary conference on Computability in Europe: how the world computes
On the computability power of membrane systems with controlled mobility
CiE'12 Proceedings of the 8th Turing Centenary conference on Computability in Europe: how the world computes
P Systems with Proteins on Membranes
Fundamenta Informaticae
Fundamenta Informaticae
On the Branching Complexity of P Systems
Fundamenta Informaticae - SPECIAL ISSUE ON TRAJECTORIES OF LANGUAGE THEORY Dedicated to the memory of Alexandru Mateescu
(Tissue) P Systems with Unit Rules and Energy Assigned to Membranes
Fundamenta Informaticae - SPECIAL ISSUE MCU2004
Abstract Geometrical Computation 1: Embedding Black Hole Computations with Rational Numbers
Fundamenta Informaticae - SPECIAL ISSUE MCU2004
Variable Complexity of Simple Programs
Fundamenta Informaticae - SPECIAL ISSUE MCU2004
Fundamenta Informaticae - SPECIAL ISSUE MCU2004
Time and Synchronization in Membrane Systems
Fundamenta Informaticae - Contagious Creativity - In Honor of the 80th Birthday of Professor Solomon Marcus
Time-Varying Distributed H Systems: An Overview
Fundamenta Informaticae - Contagious Creativity - In Honor of the 80th Birthday of Professor Solomon Marcus
Symport/Antiport P Systems with Three Objects Are Universal
Fundamenta Informaticae - Contagious Creativity - In Honor of the 80th Birthday of Professor Solomon Marcus
GP Systems with Forbidding Context
Fundamenta Informaticae - Membrane Computing (WMC-CdeA2001)
Self-describing Turing machines
Fundamenta Informaticae
UPSILON: Universal Programming System with Incomplete Lazy Object Notation
Fundamenta Informaticae
Synchronization of a Line of Identical Processors at a Given Time
Fundamenta Informaticae
UNDECIDABILITY OF LANGUAGE EQUIVALENCE FOR GENERALIZED REGULAR EXPRESSIONS
Fundamenta Informaticae
Communications of the ACM
Applicability conditions for plans with loops: Computability results and algorithms
Artificial Intelligence
Stateless multicounter 5' → 3' Watson---Crick automata: the deterministic case
Natural Computing: an international journal
Asynchronous spiking neural P systems with local synchronization
Information Sciences: an International Journal
FCT'07 Proceedings of the 16th international conference on Fundamentals of Computation Theory
Polarizationless P systems with active membranes working in the minimally parallel mode
UC'07 Proceedings of the 6th international conference on Unconventional Computation
Behavioural contracts with request-response operations
Science of Computer Programming
On the Termination of Integer Loops
ACM Transactions on Programming Languages and Systems (TOPLAS)
Automatic vandalism detection in wikipedia with active associative classification
TPDL'12 Proceedings of the Second international conference on Theory and Practice of Digital Libraries
Decidability problems for actor systems
CONCUR'12 Proceedings of the 23rd international conference on Concurrency Theory
Towards a formal component model for the cloud
SEFM'12 Proceedings of the 10th international conference on Software Engineering and Formal Methods
UCNC'12 Proceedings of the 11th international conference on Unconventional Computation and Natural Computation
P systems with minimal left and right insertion and deletion
UCNC'12 Proceedings of the 11th international conference on Unconventional Computation and Natural Computation
The complexity of bounded synthesis for timed control with partial observability
FORMATS'12 Proceedings of the 10th international conference on Formal Modeling and Analysis of Timed Systems
Computability and non-computability issues in amorphous computing
TCS'12 Proceedings of the 7th IFIP TC 1/WG 202 international conference on Theoretical Computer Science
On the coverability and reachability languages of monotonic extensions of Petri nets
Theoretical Computer Science
On persistent reachability in Petri nets
Information and Computation
(Tissue) p systems with decaying objects
CMC'12 Proceedings of the 13th international conference on Membrane Computing
Turing computability and membrane computing
CMC'12 Proceedings of the 13th international conference on Membrane Computing
CMC'12 Proceedings of the 13th international conference on Membrane Computing
Sequential p systems with regular control
CMC'12 Proceedings of the 13th international conference on Membrane Computing
Integer parameter synthesis for timed automata
TACAS'13 Proceedings of the 19th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Ten Years of Building Broken Chips: The Physics and Engineering of Inexact Computing
ACM Transactions on Embedded Computing Systems (TECS) - Special Section on Probabilistic Embedded Computing
Turing patterns with Turing machines: emergence and low-level structure formation
Natural Computing: an international journal
International Journal of Computing Science and Mathematics
The ARNN model relativises P =NP and P≠NP
Theoretical Computer Science
Universality of sequential spiking neural P systems based on minimum spike number
Theoretical Computer Science
On the complexity of verifying regular properties on flat counter systems,
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part II
Rational subsets and submonoids of wreath products
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part II
Superposition for bounded domains
Automated Reasoning and Mathematics
The firing squad synchronization problem with sub-generals
Information Processing Letters
Verification of gap-order constraint abstractions of counter systems
Theoretical Computer Science
Operating systems principles and undergraduate computer science curricula
ACM SIGMIS Database
ACM SIGMIS Database
Effective storage capacity of labeled graphs
Information and Computation
Cellular Resource-Driven Automata
Fundamenta Informaticae - Concurrency Specification and Programming CS&P
Bridging Membrane and Reaction Systems --Further Results and Research Topics
Fundamenta Informaticae - To Andrzej Skowron on His 70th Birthday
Spiking neural P systems with rules on synapses
Theoretical Computer Science
Hi-index | 0.26 |
From the Preface (See Front Matter for full Preface) Man has within a single generation found himself sharing the world with a strange new species: the computers and computer-like machines. Neither history, nor philosophy, nor common sense will tell us how these machines will affect us, for they do not do "work" as did machines of the Industrial Revolution. Instead of dealing with materials or energy, we are told that they handle "control" and "information" and even "intellectual processes." There are very few individuals today who doubt that the computer and its relatives are developing rapidly in capability and complexity, and that these machines are destined to play important (though not as yet fully understood) roles in society's future. Though only some of us deal directly with computers, all of us are falling under the shadow of their ever-growing sphere of influence, and thus we all need to understand their capabilities and their limitations. It would indeed be reassuring to have a book that categorically and systematically described what all these machines can do and what they cannot do, giving sound theoretical or practical grounds for each judgment. However, although some books have purported to do this, it cannot be done for the following reasons: a) Computer-like devices are utterly unlike anything which science has ever considered---we still lack the tools necessary to fully analyze, synthesize, or even think about them; and b) The methods discovered so far are effective in certain areas, but are developing much too rapidly to allow a useful interpretation and interpolation of results. The abstract theory---as described in this book---tells us in no uncertain terms that the machines' potential range is enormous, and that its theoretical limitations are of the subtlest and most elusive sort. There is no reason to suppose machines have any limitations not shared by man.