A new decidable problem, with applications (original) (raw)
Related papers
Cybernetics, 1977
The equivalence problem for program schemata with nonintersecting loops
Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages - POPL '77, 1977
Computability and complexity properties of automatic structures and their applications
2008
On the Edge of Decidability in Complexity Analysis of Loop Programs
International Journal of Foundations of Computer Science, 2012
On Flowchart Theories. I. The Deterministic Case
Journal of Computer and System Sciences, 1987
Multi-dimensional Rankings, Program Termination, and Complexity Bounds of Flowchart Programs
Christophe Alias, Paul Feautrier
Lecture Notes in Computer Science, 2010
Chapter 2 Languages , Decidability , and Complexity
2012
Languages, decidability, and complexity
Lecture Notes in Control and Information Sciences, 2013
The Complexity of Automated Reasoning
1989
Decidability, complexity and automated reasoning in relevant logic
1991
Rice-Like Theorems for Automata Networks
2021
Propositional dynamic logic of flowcharts
1983
What’s decidable about linear loops?
Proceedings of the ACM on Programming Languages
Order, 1987
Nondeterministic Flowchart Programs with Recursive Procedures: Semantics and Correctness I
Theoretical Computer Science, 1981
Algebraic Characterization of Reducible Flowcharts
Journal of Computer and System Sciences, 1983
The (generalized) Post Correspondence Problem with lists consisting of two words is decidable
Theoretical Computer Science, 1982
On cellular graph-automata and second-order definable graph-properties
Fundamentals of Computation Theory, 1981
Flowchart Programs, Regular Expressions, and Decidability of Polynomial Growth-Rate
2016
Completely Reachable Automata: An Interplay Between Automata, Graphs, and Trees
International Journal of Foundations of Computer Science
Subclasses of Formalized Data Flow Diagrams: Monogeneous, Linear & Topologically Free Choice RDFD's
1996
On the Decidability of Termination for Polynomial Loops
arXiv (Cornell University), 2019
On decidability and axiomatizability of some ordered structures
Soft Computing
On Elementary Loops and Proper Loops for Disjunctive Logic Programs
Proceedings of the AAAI Conference on Artificial Intelligence
Decidability, behavioural equivalences and infinite transition graphs
1991
Automated verification: Graphs, logic, and automata
2003
A decidability theorem for a class of vector-addition systems
Information Processing Letters, 1975
Program schemata and the first-order decision problem
Journal of Computer and System Sciences, 1974
Expressive power of digraph solvability
Annals of Pure and Applied Logic, 2012
On elementary loops of logic programs
Theory and Practice of Logic Programming, 2011
Complexity of Some Problems from the Theory of Automata
Automata-based presentations of infinite structures
Finite and Algorithmic Model Theory (volume 379 of London Mathematical Society Lecture Notes Series), 2011
Bounding the Computational Complexity of Flowchart Programs with Multi-dimensional Rankings
Christophe Alias, Paul Feautrier
The Computer Journal, 1994
Elements of Algorithmic Graph Theory. An Exercise in Point-Free Reasoning