Reasoning About the Past With Two-Way Automata

Lecture Notes in Computer Science - Germany
doi 10.1007/bfb0055090
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Berlin Heidelberg

Related search

A Note on One-Way and Two-Way Automata

Theory of Computing Systems
Computational TheoryTheoretical Computer ScienceMathematics
1970English

Leveraging Weighted Automata in Compositional Reasoning About Concurrent Probabilistic Systems

ACM SIGPLAN Notices
Computer Science
2015English

The Finite Graph Problem for Two-Way Alternating Automata

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2001English

Describing Periodicity in Two-Way Deterministic Finite Automata Using Transformation Semigroups

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2011English

Shrinking One-Way Cellular Automata

Natural Computing
Computer Science Applications
2016English

Reasoning With Concept Diagrams About Antipatterns

English

Representing and Reasoning About Motion in a Two-Dimensional World

Computational Intelligence
Computational MathematicsArtificial Intelligence
1998English

Reasoning About Knowledge From the Web

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2012English

Reasoning About Justified Belief

2011English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2026 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy