Highly Undecidable Problems About Recognizability by Tiling Systems

Fundamenta Informaticae - Netherlands
doi 10.3233/fi-2009-0045
Full Text
Abstract

Available in full text

Date
Authors
Publisher

IOS Press

Related search

Low Dimensional Hybrid Systems – Decidable, Undecidable, Donʼt Know

Information and Computation
Theoretical Computer ScienceComputational TheoryComputer Science ApplicationsInformation SystemsMathematics
2012English

Hard Tiling Problems With Simple Tiles

Discrete and Computational Geometry
CombinatoricsMathematicsGeometryDiscrete MathematicsComputational TheoryTopologyTheoretical Computer Science
2001English

On the Complexity of Undecidable Problems in Automata Theory

1967English

Probabilistic Automata on Finite Words: Decidable and Undecidable Problems

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2010English

Recognizability of Redexes for Higher-Order Rewrite Systems

IPSJ Online Transactions
2009English

Imaging by Convergent Tiling

Computers in Physics
1990English

Bisimulation and Other Undecidable Equivalences for Lossy Channel Systems

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2001English

Decidable and Undecidable Problems in Schedulability Analysis Using Timed Automata

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2004English

Practical Glossing by Prioritised Tiling

1998English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy