The Emptiness Problem for Valence Automata or: Another Decidable Extension of Petri Nets
|
|
- Barnard Little
- 6 years ago
- Views:
Transcription
1 The Emptiness Problem for Valence Automata or: Another Decidable Extension of Petri Nets Georg Zetzsche Technische Universität Kaiserslautern Reachability Problems 2015 Georg Zetzsche (TU KL) Emptiness for Valence Automata RP / 19
2 Example (Pushdown automaton) a, ε, A a, A, ε q 0 ε, ε, ε q 1 b, ε, B b, B, ε Georg Zetzsche (TU KL) Emptiness for Valence Automata RP / 19
3 Example (Pushdown automaton) a, ε, A a, A, ε q 0 ε, ε, ε q 1 L tww rev w P ta, bu u b, ε, B b, B, ε Georg Zetzsche (TU KL) Emptiness for Valence Automata RP / 19
4 Example (Pushdown automaton) a, ε, A a, A, ε q 0 ε, ε, ε q 1 L tww rev w P ta, bu u b, ε, B b, B, ε Example (Blind counter automaton) a, 1, 0 b, 1, 1 c, 0, 1 ε, 0, 0 ε, 0, 0 q 0 q 1 q 2 Georg Zetzsche (TU KL) Emptiness for Valence Automata RP / 19
5 Example (Pushdown automaton) a, ε, A a, A, ε q 0 ε, ε, ε q 1 L tww rev w P ta, bu u b, ε, B b, B, ε Example (Blind counter automaton) a, 1, 0 b, 1, 1 c, 0, 1 ε, 0, 0 ε, 0, 0 q 0 q 1 q 2 L ta n b n c n n ě 0u Georg Zetzsche (TU KL) Emptiness for Valence Automata RP / 19
6 Example (Partially blind counter automaton) a, 1 q 0 ε, 0 ε, 1 q 1 b, 1 Georg Zetzsche (TU KL) Emptiness for Valence Automata RP / 19
7 Example (Partially blind counter automaton) a, 1 q 0 ε, 0 ε, 1 q 1 b, 1 L tw P ta, bu p a ě p b for each prefix p of wu Georg Zetzsche (TU KL) Emptiness for Valence Automata RP / 19
8 Storage mechanisms Automata models that extend finite automata by some storage mechanism: Pushdown automata Blind counter automata Partially blind counter automata Turing machines Goal: General insights Structure of storage ô computational properties Georg Zetzsche (TU KL) Emptiness for Valence Automata RP / 19
9 Storage mechanisms Automata models that extend finite automata by some storage mechanism: Pushdown automata Blind counter automata Partially blind counter automata Turing machines Goal: General insights Structure of storage ô computational properties Framework Abstract model with storage as parameter Georg Zetzsche (TU KL) Emptiness for Valence Automata RP / 19
10 Valence automata Definition A monoid is a set M with an associative binary operation : M ˆ M Ñ M and a neutral element 1 P M (a1 1a a for any a P M). Georg Zetzsche (TU KL) Emptiness for Valence Automata RP / 19
11 Valence automata Definition A monoid is a set M with an associative binary operation : M ˆ M Ñ M and a neutral element 1 P M (a1 1a a for any a P M). Common generalization: Valence Automata Valence automaton over M: Finite automaton with edges p w m ÝÝÑq, w P Σ, m P M. Georg Zetzsche (TU KL) Emptiness for Valence Automata RP / 19
12 Valence automata Definition A monoid is a set M with an associative binary operation : M ˆ M Ñ M and a neutral element 1 P M (a1 1a a for any a P M). Common generalization: Valence Automata Valence automaton over M: Finite automaton with edges p w m ÝÝÑq, w P Σ, m P M. w 1 m 1 w 2 m 2 w n m n Run q 0ÝÝÝÑq1 ÝÝÝÑ ÝÝÝÑq n is accepting for w 1 w n if q 0 is the initial state, q n is a final state, and Georg Zetzsche (TU KL) Emptiness for Valence Automata RP / 19
13 Valence automata Definition A monoid is a set M with an associative binary operation : M ˆ M Ñ M and a neutral element 1 P M (a1 1a a for any a P M). Common generalization: Valence Automata Valence automaton over M: Finite automaton with edges p w m ÝÝÑq, w P Σ, m P M. w 1 m 1 w 2 m 2 w n m n Run q 0ÝÝÝÑq1 ÝÝÝÑ ÝÝÝÑq n is accepting for w 1 w n if q 0 is the initial state, q n is a final state, and m 1 m n 1. Georg Zetzsche (TU KL) Emptiness for Valence Automata RP / 19
14 Valence automata Definition A monoid is a set M with an associative binary operation : M ˆ M Ñ M and a neutral element 1 P M (a1 1a a for any a P M). Common generalization: Valence Automata Valence automaton over M: Finite automaton with edges p w m ÝÝÑq, w P Σ, m P M. w 1 m 1 w 2 m 2 w n m n Run q 0ÝÝÝÑq1 ÝÝÝÑ ÝÝÝÑq n is accepting for w 1 w n if q 0 is the initial state, q n is a final state, and m 1 m n 1. Language class VApMq languages accepted by valence automata over M. Georg Zetzsche (TU KL) Emptiness for Valence Automata RP / 19
15 Classical results can now be generalized: Questions For which storage mechanisms can we decide emptiness? Georg Zetzsche (TU KL) Emptiness for Valence Automata RP / 19
16 Classical results can now be generalized: Questions For which storage mechanisms can we decide emptiness? For which do we have a particular closure property? Georg Zetzsche (TU KL) Emptiness for Valence Automata RP / 19
17 Classical results can now be generalized: Questions For which storage mechanisms can we decide emptiness? For which do we have a particular closure property? How is the complexity of decision problems affected? Georg Zetzsche (TU KL) Emptiness for Valence Automata RP / 19
18 Classical results can now be generalized: Questions For which storage mechanisms can we decide emptiness? For which do we have a particular closure property? How is the complexity of decision problems affected? For which can we compute abstractions? Georg Zetzsche (TU KL) Emptiness for Valence Automata RP / 19
19 Monoids defined by graphs By graphs, we mean undirected graphs with loops allowed. Georg Zetzsche (TU KL) Emptiness for Valence Automata RP / 19
20 Monoids defined by graphs By graphs, we mean undirected graphs with loops allowed. Let Γ pv, Eq be a graph. Let X Γ ta v, ā v v P V u Georg Zetzsche (TU KL) Emptiness for Valence Automata RP / 19
21 Monoids defined by graphs By graphs, we mean undirected graphs with loops allowed. Let Γ pv, Eq be a graph. Let X Γ ta v, ā v v P V u R Γ ta v ā v ε v P V u Georg Zetzsche (TU KL) Emptiness for Valence Automata RP / 19
22 Monoids defined by graphs By graphs, we mean undirected graphs with loops allowed. Let Γ pv, Eq be a graph. Let X Γ ta v, ā v v P V u R Γ ta v ā v ε v P V u Y txy yx x P ta u, ā u u, y P ta v, ā v u, tu, vu P Eu Georg Zetzsche (TU KL) Emptiness for Valence Automata RP / 19
23 Monoids defined by graphs By graphs, we mean undirected graphs with loops allowed. Let Γ pv, Eq be a graph. Let X Γ ta v, ā v v P V u R Γ ta v ā v ε v P V u Y txy yx x P ta u, ā u u, y P ta v, ā v u, tu, vu P Eu MΓ X Γ {R Γ Georg Zetzsche (TU KL) Emptiness for Valence Automata RP / 19
24 Monoids defined by graphs By graphs, we mean undirected graphs with loops allowed. Let Γ pv, Eq be a graph. Let Intuition X Γ ta v, ā v v P V u R Γ ta v ā v ε v P V u Y txy yx x P ta u, ā u u, y P ta v, ā v u, tu, vu P Eu MΓ X Γ {R Γ B: bicyclic monoid, B ta, āu {taā εu. Z: group of integers For each unlooped vertex, we have a copy of B For each looped vertex, we have a copy of Z MΓ consists of sequences of such elements An edge between vertices means that elements can commute Georg Zetzsche (TU KL) Emptiness for Valence Automata RP / 19
25 Examples Georg Zetzsche (TU KL) Emptiness for Valence Automata RP / 19
26 Examples Z 3 Georg Zetzsche (TU KL) Emptiness for Valence Automata RP / 19
27 Examples Z 3 Blind counter Georg Zetzsche (TU KL) Emptiness for Valence Automata RP / 19
28 Examples Z 3 Blind counter Georg Zetzsche (TU KL) Emptiness for Valence Automata RP / 19
29 Examples Z 3 B B B Blind counter Georg Zetzsche (TU KL) Emptiness for Valence Automata RP / 19
30 Examples Z 3 B B B Blind counter Pushdown Georg Zetzsche (TU KL) Emptiness for Valence Automata RP / 19
31 Examples Z 3 B B B Blind counter Pushdown Georg Zetzsche (TU KL) Emptiness for Valence Automata RP / 19
32 Examples Z 3 B B B Blind counter Pushdown B 3 Georg Zetzsche (TU KL) Emptiness for Valence Automata RP / 19
33 Examples Z 3 B B B Blind counter Pushdown B 3 Partially blind counter Georg Zetzsche (TU KL) Emptiness for Valence Automata RP / 19
34 Examples Z 3 B B B Blind counter Pushdown B 3 Partially blind counter Georg Zetzsche (TU KL) Emptiness for Valence Automata RP / 19
35 Examples Z 3 B B B Blind counter Pushdown B 3 Partially blind counter Georg Zetzsche (TU KL) Emptiness for Valence Automata RP / 19
36 Examples Z 3 B B B Blind counter Pushdown B 3 pb Bq ˆ pb Bq Partially blind counter Georg Zetzsche (TU KL) Emptiness for Valence Automata RP / 19
37 Examples Z 3 B B B Blind counter Pushdown B 3 pb Bq ˆ pb Bq Partially blind counter Infinite tape (TM) Georg Zetzsche (TU KL) Emptiness for Valence Automata RP / 19
38 Examples Z 3 B B B Blind counter Pushdown B 3 pb Bq ˆ pb Bq Partially blind counter Infinite tape (TM) Georg Zetzsche (TU KL) Emptiness for Valence Automata RP / 19
39 Examples Z 3 B B B Blind counter Pushdown B 3 pb Bq ˆ pb Bq Partially blind counter Infinite tape (TM) Georg Zetzsche (TU KL) Emptiness for Valence Automata RP / 19
40 Examples Z 3 B B B Blind counter Pushdown B 3 pb Bq ˆ pb Bq Partially blind counter Infinite tape (TM) Georg Zetzsche (TU KL) Emptiness for Valence Automata RP / 19
41 Examples Z 3 B B B Blind counter Pushdown pb Bq ˆ B ˆ B B 3 pb Bq ˆ pb Bq Partially blind counter Infinite tape (TM) Georg Zetzsche (TU KL) Emptiness for Valence Automata RP / 19
42 Examples Z 3 B B B Blind counter Pushdown pb Bq ˆ B ˆ B Pushdown + partially blind counters B 3 pb Bq ˆ pb Bq Partially blind counter Infinite tape (TM) Georg Zetzsche (TU KL) Emptiness for Valence Automata RP / 19
43 The emptiness problem The emptiness problem Given a valence automaton over M, does it accept any word? Georg Zetzsche (TU KL) Emptiness for Valence Automata RP / 19
44 The emptiness problem The emptiness problem Given a valence automaton over M, does it accept any word? Important problem Type of reachability problem Necessary for many other decision problems. Georg Zetzsche (TU KL) Emptiness for Valence Automata RP / 19
45 The emptiness problem The emptiness problem Given a valence automaton over M, does it accept any word? Important problem Type of reachability problem Necessary for many other decision problems. Question For which storage mechanisms is the emptiness problem decidable? Georg Zetzsche (TU KL) Emptiness for Valence Automata RP / 19
46 The emptiness problem The emptiness problem Given a valence automaton over M, does it accept any word? Important problem Type of reachability problem Necessary for many other decision problems. Question For which storage mechanisms is the emptiness problem decidable? Obstacle Pushdown + partially blind counters Georg Zetzsche (TU KL) Emptiness for Valence Automata RP / 19
47 The emptiness problem The emptiness problem Given a valence automaton over M, does it accept any word? Important problem Type of reachability problem Necessary for many other decision problems. Question For which storage mechanisms is the emptiness problem decidable? Obstacle Pushdown + partially blind counters Decidability a long-standing open problem Georg Zetzsche (TU KL) Emptiness for Valence Automata RP / 19
48 Simplest graphs for pushdown + counters One can show: These can simulate pushdown + one counter Georg Zetzsche (TU KL) Emptiness for Valence Automata RP / 19
49 Simplest graphs for pushdown + counters One can show: These can simulate pushdown + one counter We call these PPN-graphs (for pushdown Petri net ). Georg Zetzsche (TU KL) Emptiness for Valence Automata RP / 19
50 Simplest graphs for pushdown + counters One can show: These can simulate pushdown + one counter We call these PPN-graphs (for pushdown Petri net ). Without them as induced subgraphs: PPN-free. Georg Zetzsche (TU KL) Emptiness for Valence Automata RP / 19
51 Simplest graphs for pushdown + counters One can show: These can simulate pushdown + one counter We call these PPN-graphs (for pushdown Petri net ). Without them as induced subgraphs: PPN-free. Theorem Let Γ be PPN-free. Then the following are equivalent: Emptiness is decidable for valence automata over MΓ. Γ, minus loops, is a transitive forest. Georg Zetzsche (TU KL) Emptiness for Valence Automata RP / 19
52 Simplest graphs for pushdown + counters One can show: These can simulate pushdown + one counter We call these PPN-graphs (for pushdown Petri net ). Without them as induced subgraphs: PPN-free. Theorem Let Γ be PPN-free. Then the following are equivalent: Emptiness is decidable for valence automata over MΓ. Γ, minus loops, is a transitive forest. Georg Zetzsche (TU KL) Emptiness for Valence Automata RP / 19
53 Georg Zetzsche (TU KL) Emptiness for Valence Automata RP / 19
54 Georg Zetzsche (TU KL) Emptiness for Valence Automata RP / 19
55 Georg Zetzsche (TU KL) Emptiness for Valence Automata RP / 19
56 Georg Zetzsche (TU KL) Emptiness for Valence Automata RP / 19
57 Georg Zetzsche (TU KL) Emptiness for Valence Automata RP / 19
58 Georg Zetzsche (TU KL) Emptiness for Valence Automata RP / 19
59 Intuition Decidable mechanisms, SC : Start with partially blind counters Build stacks Add blind counters Georg Zetzsche (TU KL) Emptiness for Valence Automata RP / 19
60 Intuition Decidable mechanisms, SC : Start with partially blind counters Build stacks Add blind counters ñ Reduction to priority counter automata of Reinhardt Georg Zetzsche (TU KL) Emptiness for Valence Automata RP / 19
61 Intuition Decidable mechanisms, SC : Start with partially blind counters Build stacks Add blind counters ñ Reduction to priority counter automata of Reinhardt Left open, SC`: Start with partially blind counters Build stacks Add partially blind counters Georg Zetzsche (TU KL) Emptiness for Valence Automata RP / 19
62 Intuition Decidable mechanisms, SC : Start with partially blind counters Build stacks Add blind counters ñ Reduction to priority counter automata of Reinhardt Left open, SC`: Start with partially blind counters Build stacks Add partially blind counters ñ Generalize pushdown Petri nets and priority counter automata ñ New open problem Georg Zetzsche (TU KL) Emptiness for Valence Automata RP / 19
63 Petri nets Priority counter Georg Zetzsche (TU KL) Emptiness for Valence Automata RP / 19
64 PPN Petri nets Priority counter Georg Zetzsche (TU KL) Emptiness for Valence Automata RP / 19
65 Poof: Undecidability Theorem (Wolk 1965) An undirected graph is a transitive forest iff it avoids as induced subgraphs: C 4 : P 4 : ñ Show Turing completeness for C 4 and P 4 Georg Zetzsche (TU KL) Emptiness for Valence Automata RP / 19
66 Poof: Decidability Decidability Combinatorial argument shows: equivalent to SC. Georg Zetzsche (TU KL) Emptiness for Valence Automata RP / 19
67 Poof: Decidability Decidability Combinatorial argument shows: equivalent to SC. Definition of SC Smallest class with B n P SC if M P SC, then B M, Z ˆ M P SC Georg Zetzsche (TU KL) Emptiness for Valence Automata RP / 19
68 Poof: Decidability Decidability Combinatorial argument shows: equivalent to SC. Definition of SC Smallest class with B n P SC if M P SC, then B M, Z ˆ M P SC Reduction ΨpVApMqq Ď Prio for every M P SC. Georg Zetzsche (TU KL) Emptiness for Valence Automata RP / 19
69 Priority counter machines Automaton with n counters Georg Zetzsche (TU KL) Emptiness for Valence Automata RP / 19
70 Priority counter machines Automaton with n counters counters stay ě 0 Georg Zetzsche (TU KL) Emptiness for Valence Automata RP / 19
71 Priority counter machines Automaton with n counters counters stay ě 0 instructions: inc i : increment counter i dec i : decrement counter i zeroi : test all the counters 1,..., i for zero Georg Zetzsche (TU KL) Emptiness for Valence Automata RP / 19
72 Priority counter machines Automaton with n counters counters stay ě 0 instructions: inc i : increment counter i dec i : decrement counter i zeroi : test all the counters 1,..., i for zero Language class: Prio Georg Zetzsche (TU KL) Emptiness for Valence Automata RP / 19
73 Priority counter machines Automaton with n counters counters stay ě 0 instructions: inc i : increment counter i dec i : decrement counter i zeroi : test all the counters 1,..., i for zero Language class: Prio Theorem (Reinhardt) Reachability is decidable for priority counter machines. Georg Zetzsche (TU KL) Emptiness for Valence Automata RP / 19
74 Definition of SC Smallest class with B n P SC if M P SC, then B M, Z ˆ M P SC Observations VApB n q Ď Prio, hence ΨpVApB n qq Ď ΨpPrioq. Georg Zetzsche (TU KL) Emptiness for Valence Automata RP / 19
75 Definition of SC Smallest class with B n P SC if M P SC, then B M, Z ˆ M P SC Observations VApB n q Ď Prio, hence ΨpVApB n qq Ď ΨpPrioq. If ΨpVApMqq Ď Prio, then ΨpVApM ˆ Zqq Ď ΨpPrioq. Georg Zetzsche (TU KL) Emptiness for Valence Automata RP / 19
76 Definition of SC Smallest class with B n P SC if M P SC, then B M, Z ˆ M P SC Observations VApB n q Ď Prio, hence ΨpVApB n qq Ď ΨpPrioq. If ΨpVApMqq Ď Prio, then ΨpVApM ˆ Zqq Ď ΨpPrioq. What about VApB Mq? Georg Zetzsche (TU KL) Emptiness for Valence Automata RP / 19
77 Expressiveness Algebraic extensions Let C be a language class. A C-grammar G consists of Nonterminals N, terminals T, start symbol S P N Productions A Ñ L with L Ď pn Y T q, L P C Georg Zetzsche (TU KL) Emptiness for Valence Automata RP / 19
78 Expressiveness Algebraic extensions Let C be a language class. A C-grammar G consists of Nonterminals N, terminals T, start symbol S P N Productions A Ñ L with L Ď pn Y T q, L P C uav ñ uwv whenever w P L. Georg Zetzsche (TU KL) Emptiness for Valence Automata RP / 19
79 Expressiveness Algebraic extensions Let C be a language class. A C-grammar G consists of Nonterminals N, terminals T, start symbol S P N Productions A Ñ L with L Ď pn Y T q, L P C uav ñ uwv whenever w P L. Generated language: tw P T S ñ wu. Georg Zetzsche (TU KL) Emptiness for Valence Automata RP / 19
80 Expressiveness Algebraic extensions Let C be a language class. A C-grammar G consists of Nonterminals N, terminals T, start symbol S P N Productions A Ñ L with L Ď pn Y T q, L P C uav ñ uwv whenever w P L. Generated language: tw P T S ñ wu. Such languages are algebraic over C, class denoted AlgpCq. Georg Zetzsche (TU KL) Emptiness for Valence Automata RP / 19
81 Expressiveness Algebraic extensions Let C be a language class. A C-grammar G consists of Nonterminals N, terminals T, start symbol S P N Productions A Ñ L with L Ď pn Y T q, L P C uav ñ uwv whenever w P L. Generated language: tw P T S ñ wu. Such languages are algebraic over C, class denoted AlgpCq. Theorem (Z. 2015) VApB B Mq AlgpVApMqq. Georg Zetzsche (TU KL) Emptiness for Valence Automata RP / 19
82 Expressiveness Algebraic extensions Let C be a language class. A C-grammar G consists of Nonterminals N, terminals T, start symbol S P N Productions A Ñ L with L Ď pn Y T q, L P C uav ñ uwv whenever w P L. Generated language: tw P T S ñ wu. Such languages are algebraic over C, class denoted AlgpCq. Theorem (Z. 2015) VApB B Mq AlgpVApMqq. Theorem (van Leeuwen 1974) If C is closed under rational transductions and Kleene star, then ΨpAlgpCqq Ď ΨpCq. Georg Zetzsche (TU KL) Emptiness for Valence Automata RP / 19
83 Conclusion PPN Petri nets Priority counter Contribution Georg Zetzsche (TU KL) Emptiness for Valence Automata RP / 19
84 Conclusion PPN Petri nets Priority counter Contribution In absence of PPN: Characterization of decidable emptiness problem Georg Zetzsche (TU KL) Emptiness for Valence Automata RP / 19
85 Conclusion PPN Petri nets Priority counter Contribution In absence of PPN: Characterization of decidable emptiness problem New decidable model (SC ) Georg Zetzsche (TU KL) Emptiness for Valence Automata RP / 19
86 Conclusion PPN Petri nets Priority counter Contribution In absence of PPN: Characterization of decidable emptiness problem New decidable model (SC ) New powerful model that might be decidable (SC`) Georg Zetzsche (TU KL) Emptiness for Valence Automata RP / 19
87 Conclusion PPN Petri nets Priority counter Contribution In absence of PPN: Characterization of decidable emptiness problem New decidable model (SC ) New powerful model that might be decidable (SC`) Georg Zetzsche (TU KL) Emptiness for Valence Automata RP / 19
Valence automata as a generalization of automata with storage
Valence automata as a generalization of automata with storage Georg Zetzsche Technische Universität Kaiserslautern D-CON 2013 Georg Zetzsche (TU KL) Valence automata D-CON 2013 1 / 23 Example (Pushdown
More informationThe Emptiness Problem for Valence Automata or: Another Decidable Extension of Petri Nets
The Emptiness Problem for Valence Automata or: Another Decidable Extension of Petri Nets Georg Zetzsche Concurrency Theory Group Fachbereich Informatik Technische Universität Kaiserslautern zetzsche@cs.uni-kl.de
More informationComputability and Complexity
Computability and Complexity Lecture 5 Reductions Undecidable problems from language theory Linear bounded automata given by Jiri Srba Lecture 5 Computability and Complexity 1/14 Reduction Informal Definition
More informationIntroduction to computability Tutorial 7
Introduction to computability Tutorial 7 Context free languages and Turing machines November 6 th 2014 Context-free languages 1. Show that the following languages are not context-free: a) L ta i b j a
More information3130CIT Theory of Computation
GRIFFITH UNIVERSITY School of Computing and Information Technology 3130CIT Theory of Computation Final Examination, Semester 2, 2006 Details Total marks: 120 (40% of the total marks for this subject) Perusal:
More informationACS2: Decidability Decidability
Decidability Bernhard Nebel and Christian Becker-Asano 1 Overview An investigation into the solvable/decidable Decidable languages The halting problem (undecidable) 2 Decidable problems? Acceptance problem
More informationCPSC 421: Tutorial #1
CPSC 421: Tutorial #1 October 14, 2016 Set Theory. 1. Let A be an arbitrary set, and let B = {x A : x / x}. That is, B contains all sets in A that do not contain themselves: For all y, ( ) y B if and only
More informationTHEORY OF COMPUTATION (AUBER) EXAM CRIB SHEET
THEORY OF COMPUTATION (AUBER) EXAM CRIB SHEET Regular Languages and FA A language is a set of strings over a finite alphabet Σ. All languages are finite or countably infinite. The set of all languages
More informationV Honors Theory of Computation
V22.0453-001 Honors Theory of Computation Problem Set 3 Solutions Problem 1 Solution: The class of languages recognized by these machines is the exactly the class of regular languages, thus this TM variant
More informationFORMAL LANGUAGES, AUTOMATA AND COMPUTATION
FORMAL LANGUAGES, AUTOMATA AND COMPUTATION DECIDABILITY ( LECTURE 15) SLIDES FOR 15-453 SPRING 2011 1 / 34 TURING MACHINES-SYNOPSIS The most general model of computation Computations of a TM are described
More informationComputability Theory
CS:4330 Theory of Computation Spring 2018 Computability Theory Decidable Problems of CFLs and beyond Haniel Barbosa Readings for this lecture Chapter 4 of [Sipser 1996], 3rd edition. Section 4.1. Decidable
More informationSYLLABUS. Introduction to Finite Automata, Central Concepts of Automata Theory. CHAPTER - 3 : REGULAR EXPRESSIONS AND LANGUAGES
Contents i SYLLABUS UNIT - I CHAPTER - 1 : AUT UTOMA OMATA Introduction to Finite Automata, Central Concepts of Automata Theory. CHAPTER - 2 : FINITE AUT UTOMA OMATA An Informal Picture of Finite Automata,
More informationSE 3310b Theoretical Foundations of Software Engineering. Turing Machines. Aleksander Essex
SE 3310b Theoretical Foundations of Software Engineering Turing Machines Aleksander Essex 1 / 1 Turing Machines 2 / 1 Introduction We ve finally arrived at a complete model of computation: Turing machines.
More informationTuring machines Finite automaton no storage Pushdown automaton storage is a stack What if we give the automaton a more flexible storage?
Turing machines Finite automaton no storage Pushdown automaton storage is a stack What if we give the automaton a more flexible storage? What is the most powerful of automata? In this lecture we will introduce
More informationDM17. Beregnelighed. Jacob Aae Mikkelsen
DM17 Beregnelighed Jacob Aae Mikkelsen January 12, 2007 CONTENTS Contents 1 Introduction 2 1.1 Operations with languages...................... 2 2 Finite Automata 3 2.1 Regular expressions/languages....................
More informationReachability in Petri nets with Inhibitor arcs
Reachability in Petri nets with Inhibitor arcs Klaus Reinhardt Universität Tübingen reinhard@informatik.uni-tuebingen.de Overview Multisets, New operators Q and Q on multisets, Semilinearity Petri nets,
More informationContext Free Language Properties
Context Free Language Properties Knowing that the context free languages are exactly those sets accepted by nondeterministic pushdown automata provides us a bit of information about them. We know that
More informationCSE 105 THEORY OF COMPUTATION
CSE 105 THEORY OF COMPUTATION Spring 2016 http://cseweb.ucsd.edu/classes/sp16/cse105-ab/ Today's learning goals Sipser Ch 3.3, 4.1 State and use the Church-Turing thesis. Give examples of decidable problems.
More informationCS20a: Turing Machines (Oct 29, 2002)
CS20a: Turing Machines (Oct 29, 2002) So far: DFA = regular languages PDA = context-free languages Today: Computability 1 Handicapped machines DFA limitations Tape head moves only one direction 2-way DFA
More informationPart I: Definitions and Properties
Turing Machines Part I: Definitions and Properties Finite State Automata Deterministic Automata (DFSA) M = {Q, Σ, δ, q 0, F} -- Σ = Symbols -- Q = States -- q 0 = Initial State -- F = Accepting States
More informationProperties of Context-Free Languages. Closure Properties Decision Properties
Properties of Context-Free Languages Closure Properties Decision Properties 1 Closure Properties of CFL s CFL s are closed under union, concatenation, and Kleene closure. Also, under reversal, homomorphisms
More informationMidterm Exam 2 CS 341: Foundations of Computer Science II Fall 2018, face-to-face day section Prof. Marvin K. Nakayama
Midterm Exam 2 CS 341: Foundations of Computer Science II Fall 2018, face-to-face day section Prof. Marvin K. Nakayama Print family (or last) name: Print given (or first) name: I have read and understand
More informationHENNING FERNAU Fachbereich IV, Abteilung Informatik, Universität Trier, D Trier, Germany
International Journal of Foundations of Computer Science c World Scientific Publishing Company PROGRAMMMED GRAMMARS WITH RULE QUEUES HENNING FERNAU Fachbereich IV, Abteilung Informatik, Universität Trier,
More informationRational subsets and submonoids of wreath products
Rational subsets and submonoids of wreath products Markus Lohrey 1, Benjamin Steinberg 2, and Georg Zetzsche 3 1 Universität Leipzig, Institut für Informatik 2 City College of New York, Department of Mathematics
More informationUNIT-VIII COMPUTABILITY THEORY
CONTEXT SENSITIVE LANGUAGE UNIT-VIII COMPUTABILITY THEORY A Context Sensitive Grammar is a 4-tuple, G = (N, Σ P, S) where: N Set of non terminal symbols Σ Set of terminal symbols S Start symbol of the
More informationFinal exam study sheet for CS3719 Turing machines and decidability.
Final exam study sheet for CS3719 Turing machines and decidability. A Turing machine is a finite automaton with an infinite memory (tape). Formally, a Turing machine is a 6-tuple M = (Q, Σ, Γ, δ, q 0,
More informationCS 301. Lecture 18 Decidable languages. Stephen Checkoway. April 2, 2018
CS 301 Lecture 18 Decidable languages Stephen Checkoway April 2, 2018 1 / 26 Decidable language Recall, a language A is decidable if there is some TM M that 1 recognizes A (i.e., L(M) = A), and 2 halts
More informationIntroduction to the Theory of Computation. Automata 1VO + 1PS. Lecturer: Dr. Ana Sokolova.
Introduction to the Theory of Computation Automata 1VO + 1PS Lecturer: Dr. Ana Sokolova http://cs.uni-salzburg.at/~anas/ Setup and Dates Lectures and Instructions 23.10. 3.11. 17.11. 24.11. 1.12. 11.12.
More informationOutline. CS21 Decidability and Tractability. Machine view of FA. Machine view of FA. Machine view of FA. Machine view of FA.
Outline CS21 Decidability and Tractability Lecture 5 January 16, 219 and Languages equivalence of NPDAs and CFGs non context-free languages January 16, 219 CS21 Lecture 5 1 January 16, 219 CS21 Lecture
More informationAutomata Theory (2A) Young Won Lim 5/31/18
Automata Theory (2A) Copyright (c) 2018 Young W. Lim. Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later
More informationacs-07: Decidability Decidability Andreas Karwath und Malte Helmert Informatik Theorie II (A) WS2009/10
Decidability Andreas Karwath und Malte Helmert 1 Overview An investigation into the solvable/decidable Decidable languages The halting problem (undecidable) 2 Decidable problems? Acceptance problem : decide
More informationIntroduction to the Theory of Computation. Automata 1VO + 1PS. Lecturer: Dr. Ana Sokolova.
Introduction to the Theory of Computation Automata 1VO + 1PS Lecturer: Dr. Ana Sokolova http://cs.uni-salzburg.at/~anas/ Setup and Dates Lectures Tuesday 10:45 pm - 12:15 pm Instructions Tuesday 12:30
More informationHarvard CS 121 and CSCI E-207 Lecture 10: CFLs: PDAs, Closure Properties, and Non-CFLs
Harvard CS 121 and CSCI E-207 Lecture 10: CFLs: PDAs, Closure Properties, and Non-CFLs Harry Lewis October 8, 2013 Reading: Sipser, pp. 119-128. Pushdown Automata (review) Pushdown Automata = Finite automaton
More informationTheory of computation: initial remarks (Chapter 11)
Theory of computation: initial remarks (Chapter 11) For many purposes, computation is elegantly modeled with simple mathematical objects: Turing machines, finite automata, pushdown automata, and such.
More information4.2 The Halting Problem
172 4.2 The Halting Problem The technique of diagonalization was discovered in 1873 by Georg Cantor who was concerned with the problem of measuring the sizes of infinite sets For finite sets we can simply
More informationModels of Computation. by Costas Busch, LSU
Models of Computation by Costas Busch, LSU 1 Computation CPU memory 2 temporary memory input memory CPU output memory Program memory 3 Example: f ( x) x 3 temporary memory input memory Program memory compute
More informationNP-completeness. Chapter 34. Sergey Bereg
NP-completeness Chapter 34 Sergey Bereg Oct 2017 Examples Some problems admit polynomial time algorithms, i.e. O(n k ) running time where n is the input size. We will study a class of NP-complete problems
More informationTheory of Computation p.1/?? Theory of Computation p.2/?? We develop examples of languages that are decidable
Decidable Languages We use languages to represent various computational problems because we have a terminology for dealing with languages Definition: A language is decidable if there is an algorithm (i.e.
More informationComputability and Complexity
Computability and Complexity Push-Down Automata CAS 705 Ryszard Janicki Department of Computing and Software McMaster University Hamilton, Ontario, Canada janicki@mcmaster.ca Ryszard Janicki Computability
More informationRATIONAL MONOID AND SEMIGROUP AUTOMATA
RATIONAL MONOID AND SEMIGROUP AUTOMATA A thesis submitted to the University of Manchester for the degree of Doctor of Philosophy in the Faculty of Engineering and Physical Sciences 2010 Elaine L. Render
More informationAC68 FINITE AUTOMATA & FORMULA LANGUAGES DEC 2013
Q.2 a. Prove by mathematical induction n 4 4n 2 is divisible by 3 for n 0. Basic step: For n = 0, n 3 n = 0 which is divisible by 3. Induction hypothesis: Let p(n) = n 3 n is divisible by 3. Induction
More informationComputation Histories
208 Computation Histories The computation history for a Turing machine on an input is simply the sequence of configurations that the machine goes through as it processes the input. An accepting computation
More informationTheory of Computation 8 Deterministic Membership Testing
Theory of Computation 8 Deterministic Membership Testing Frank Stephan Department of Computer Science Department of Mathematics National University of Singapore fstephan@comp.nus.edu.sg Theory of Computation
More informationIntroduction to Formal Languages, Automata and Computability p.1/42
Introduction to Formal Languages, Automata and Computability Pushdown Automata K. Krithivasan and R. Rama Introduction to Formal Languages, Automata and Computability p.1/42 Introduction We have considered
More informationMusic as a Formal Language
Music as a Formal Language Finite-State Automata and Pd Bryan Jurish moocow@ling.uni-potsdam.de Universität Potsdam, Institut für Linguistik, Potsdam, Germany pd convention 2004 / Jurish / Music as a formal
More informationRegular Expressions and Language Properties
Regular Expressions and Language Properties Mridul Aanjaneya Stanford University July 3, 2012 Mridul Aanjaneya Automata Theory 1/ 47 Tentative Schedule HW #1: Out (07/03), Due (07/11) HW #2: Out (07/10),
More informationCS6901: review of Theory of Computation and Algorithms
CS6901: review of Theory of Computation and Algorithms Any mechanically (automatically) discretely computation of problem solving contains at least three components: - problem description - computational
More informationTheory of Computation
Theory of Computation (Feodor F. Dragan) Department of Computer Science Kent State University Spring, 2018 Theory of Computation, Feodor F. Dragan, Kent State University 1 Before we go into details, what
More informationNon-emptiness Testing for TMs
180 5. Reducibility The proof of unsolvability of the halting problem is an example of a reduction: a way of converting problem A to problem B in such a way that a solution to problem B can be used to
More informationCSCE 551 Final Exam, Spring 2004 Answer Key
CSCE 551 Final Exam, Spring 2004 Answer Key 1. (10 points) Using any method you like (including intuition), give the unique minimal DFA equivalent to the following NFA: 0 1 2 0 5 1 3 4 If your answer is
More informationHKN CS/ECE 374 Midterm 1 Review. Nathan Bleier and Mahir Morshed
HKN CS/ECE 374 Midterm 1 Review Nathan Bleier and Mahir Morshed For the most part, all about strings! String induction (to some extent) Regular languages Regular expressions (regexps) Deterministic finite
More informationReversal-Bounded Counter Machines Revisited
Reversal-Bounded Counter Machines Revisited Alain Finkel 1 and Arnaud Sangnier 1,2 1 LSV, ENS Cachan, CNRS & 2 EDF R&D 61 av. du pdt Wilson 94230 Cachan. France {finkel,sangnier}@lsv.ens-cachan.fr Abstract.
More informationAdvanced Automata Theory 10 Transducers and Rational Relations
Advanced Automata Theory 10 Transducers and Rational Relations Frank Stephan Department of Computer Science Department of Mathematics National University of Singapore fstephan@comp.nus.edu.sg Advanced
More informationSome techniques and results in deciding bisimilarity
Some techniques and results in deciding bisimilarity Petr Jančar Dept of Computer Science Technical University Ostrava (FEI VŠB-TU) Czech Republic www.cs.vsb.cz/jancar Talk at the Verification Seminar,
More information15-251: Great Theoretical Ideas in Computer Science Lecture 7. Turing s Legacy Continues
15-251: Great Theoretical Ideas in Computer Science Lecture 7 Turing s Legacy Continues Solvable with Python = Solvable with C = Solvable with Java = Solvable with SML = Decidable Languages (decidable
More informationIntroduction to Languages and Computation
Introduction to Languages and Computation George Voutsadakis 1 1 Mathematics and Computer Science Lake Superior State University LSSU Math 400 George Voutsadakis (LSSU) Languages and Computation July 2014
More informationNPDA, CFG equivalence
NPDA, CFG equivalence Theorem A language L is recognized by a NPDA iff L is described by a CFG. Must prove two directions: ( ) L is recognized by a NPDA implies L is described by a CFG. ( ) L is described
More informationPushdown Automata. Notes on Automata and Theory of Computation. Chia-Ping Chen
Pushdown Automata Notes on Automata and Theory of Computation Chia-Ping Chen Department of Computer Science and Engineering National Sun Yat-Sen University Kaohsiung, Taiwan ROC Pushdown Automata p. 1
More informationA Reduction of Finitely Expandable Deep Pushdown Automata
http://excel.fit.vutbr.cz A Reduction of Finitely Expandable Deep Pushdown Automata Lucie Dvořáková Abstract For a positive integer n, n-expandable deep pushdown automata always contain no more than n
More informationFurther discussion of Turing machines
Further discussion of Turing machines In this lecture we will discuss various aspects of decidable and Turing-recognizable languages that were not mentioned in previous lectures. In particular, we will
More informationTHEORY OF COMPUTATION
THEORY OF COMPUTATION There are four sorts of men: He who knows not and knows not he knows not: he is a fool - shun him; He who knows not and knows he knows not: he is simple teach him; He who knows and
More informationCS3719 Theory of Computation and Algorithms
CS3719 Theory of Computation and Algorithms Any mechanically (automatically) discretely computation of problem solving contains at least three components: - problem description - computational tool - analysis
More informationAutomata Theory, Computability and Complexity
Automata Theory, Computability and Complexity Mridul Aanjaneya Stanford University June 26, 22 Mridul Aanjaneya Automata Theory / 64 Course Staff Instructor: Mridul Aanjaneya Office Hours: 2:PM - 4:PM,
More informationPushdown Automata (Pre Lecture)
Pushdown Automata (Pre Lecture) Dr. Neil T. Dantam CSCI-561, Colorado School of Mines Fall 2017 Dantam (Mines CSCI-561) Pushdown Automata (Pre Lecture) Fall 2017 1 / 41 Outline Pushdown Automata Pushdown
More informationUses of finite automata
Chapter 2 :Finite Automata 2.1 Finite Automata Automata are computational devices to solve language recognition problems. Language recognition problem is to determine whether a word belongs to a language.
More informationDecidability (intro.)
CHAPTER 4 Decidability Contents Decidable Languages decidable problems concerning regular languages decidable problems concerning context-free languages The Halting Problem The diagonalization method The
More informationDES. 4. Petri Nets. Introduction. Different Classes of Petri Net. Petri net properties. Analysis of Petri net models
4. Petri Nets Introduction Different Classes of Petri Net Petri net properties Analysis of Petri net models 1 Petri Nets C.A Petri, TU Darmstadt, 1962 A mathematical and graphical modeling method. Describe
More informationComplexity Theory VU , SS The Polynomial Hierarchy. Reinhard Pichler
Complexity Theory Complexity Theory VU 181.142, SS 2018 6. The Polynomial Hierarchy Reinhard Pichler Institut für Informationssysteme Arbeitsbereich DBAI Technische Universität Wien 15 May, 2018 Reinhard
More informationOutline. Complexity Theory EXACT TSP. The Class DP. Definition. Problem EXACT TSP. Complexity of EXACT TSP. Proposition VU 181.
Complexity Theory Complexity Theory Outline Complexity Theory VU 181.142, SS 2018 6. The Polynomial Hierarchy Reinhard Pichler Institut für Informationssysteme Arbeitsbereich DBAI Technische Universität
More informationX-machines - a computational model framework.
Chapter 2. X-machines - a computational model framework. This chapter has three aims: To examine the main existing computational models and assess their computational power. To present the X-machines as
More informationCSE 105 THEORY OF COMPUTATION
CSE 105 THEORY OF COMPUTATION Spring 2017 http://cseweb.ucsd.edu/classes/sp17/cse105-ab/ Review of CFG, CFL, ambiguity What is the language generated by the CFG below: G 1 = ({S,T 1,T 2 }, {0,1,2}, { S
More informationCSE 105 THEORY OF COMPUTATION. Spring 2018 review class
CSE 105 THEORY OF COMPUTATION Spring 2018 review class Today's learning goals Summarize key concepts, ideas, themes from CSE 105. Approach your final exam studying with confidence. Identify areas to focus
More informationarxiv:math/ v1 [math.gr] 8 Nov 2004
arxiv:math/0411166v1 [math.gr] 8 Nov 2004 CONTEXT-FREE ND 1-COUNTER GEODESIC LNGUGE FOR BUMSLG-SOLITR GROUP MURRY ELDER bstract. We give a language of unique geodesic normal forms for the Baumslag- Solitar
More informationDiscrete Parameters in Petri Nets
Discrete Parameters in Petri Nets SYNCOP2015 Based on a Paper accepted in PN2015 Nicolas David, Claude Jard, Didier Lime, Olivier H. Roux April 22, 2015 Nicolas David, Claude Jard, Didier Lime, Olivier
More informationSOLUTION: SOLUTION: SOLUTION:
Convert R and S into nondeterministic finite automata N1 and N2. Given a string s, if we know the states N1 and N2 may reach when s[1...i] has been read, we are able to derive the states N1 and N2 may
More information1 Showing Recognizability
CSCC63 Worksheet Recognizability and Decidability 1 1 Showing Recognizability 1.1 An Example - take 1 Let Σ be an alphabet. L = { M M is a T M and L(M) }, i.e., that M accepts some string from Σ. Prove
More informationAutomata with modulo counters and nondeterministic counter bounds
Loughborough University Institutional Repository Automata with modulo counters and nondeterministic counter bounds This item was submitted to Loughborough University's Institutional Repository by the/an
More informationLecture 23 : Nondeterministic Finite Automata DRAFT Connection between Regular Expressions and Finite Automata
CS/Math 24: Introduction to Discrete Mathematics 4/2/2 Lecture 23 : Nondeterministic Finite Automata Instructor: Dieter van Melkebeek Scribe: Dalibor Zelený DRAFT Last time we designed finite state automata
More informationTheory of Computation (IX) Yijia Chen Fudan University
Theory of Computation (IX) Yijia Chen Fudan University Review The Definition of Algorithm Polynomials and their roots A polynomial is a sum of terms, where each term is a product of certain variables and
More informationLiveness in L/U-Parametric Timed Automata
Liveness in L/U-Parametric Timed Automata Étienne André and Didier Lime [AL17] Université Paris 13, LIPN and École Centrale de Nantes, LS2N Highlights, 14 September 2017, London, England Étienne André
More informationCSCE 551: Chin-Tser Huang. University of South Carolina
CSCE 551: Theory of Computation Chin-Tser Huang huangct@cse.sc.edu University of South Carolina Computation History A computation history of a TM M is a sequence of its configurations C 1, C 2,, C l such
More informationWhat is this course about?
What is this course about? Examining the power of an abstract machine What can this box of tricks do? What is this course about? Examining the power of an abstract machine Domains of discourse: automata
More informationNew Complexity Results for Some Linear Counting Problems Using Minimal Solutions to Linear Diophantine Equations
New Complexity Results for Some Linear Counting Problems Using Minimal Solutions to Linear Diophantine Equations (Extended Abstract) Gaoyan Xie, Cheng Li and Zhe Dang School of Electrical Engineering and
More informationRational graphs trace context-sensitive languages
Rational graphs trace context-sensitive languages Christophe Morvan 1 and Colin Stirling 2 1 IRISA, Campus de eaulieu, 35042 Rennes, France christophe.morvan@irisa.fr 2 Division of Informatics, University
More informationLecture Notes on Inductive Definitions
Lecture Notes on Inductive Definitions 15-312: Foundations of Programming Languages Frank Pfenning Lecture 2 August 28, 2003 These supplementary notes review the notion of an inductive definition and give
More informationChapter 2: Finite Automata
Chapter 2: Finite Automata 2.1 States, State Diagrams, and Transitions Finite automaton is the simplest acceptor or recognizer for language specification. It is also the simplest model of a computer. A
More informationDecision Problems with TM s. Lecture 31: Halting Problem. Universe of discourse. Semi-decidable. Look at following sets: CSCI 81 Spring, 2012
Decision Problems with TM s Look at following sets: Lecture 31: Halting Problem CSCI 81 Spring, 2012 Kim Bruce A TM = { M,w M is a TM and w L(M)} H TM = { M,w M is a TM which halts on input w} TOTAL TM
More informationLecture 17: Language Recognition
Lecture 17: Language Recognition Finite State Automata Deterministic and Non-Deterministic Finite Automata Regular Expressions Push-Down Automata Turing Machines Modeling Computation When attempting to
More informationSimulation Preorder on Simple Process Algebras
Simulation Preorder on Simple Process Algebras Antonín Kučera and Richard Mayr Faculty of Informatics MU, Botanická 68a, 6000 Brno, Czech Repubic, tony@fi.muni.cz Institut für Informatik TUM, Arcisstr.,
More informationUndecidability COMS Ashley Montanaro 4 April Department of Computer Science, University of Bristol Bristol, UK
COMS11700 Undecidability Department of Computer Science, University of Bristol Bristol, UK 4 April 2014 COMS11700: Undecidability Slide 1/29 Decidability We are particularly interested in Turing machines
More informationMidterm Exam 2 CS 341: Foundations of Computer Science II Fall 2016, face-to-face day section Prof. Marvin K. Nakayama
Midterm Exam 2 CS 341: Foundations of Computer Science II Fall 2016, face-to-face day section Prof. Marvin K. Nakayama Print family (or last) name: Print given (or first) name: I have read and understand
More informationSection 14.1 Computability then else
Section 14.1 Computability Some problems cannot be solved by any machine/algorithm. To prove such statements we need to effectively describe all possible algorithms. Example (Turing machines). Associate
More informationDiscrete Event Systems Exam
Computer Engineering and Networks Laboratory TEC, NSG, DISCO HS 2016 Prof. L. Thiele, Prof. L. Vanbever, Prof. R. Wattenhofer Discrete Event Systems Exam Friday, 3 rd February 2017, 14:00 16:00. Do not
More informationFORMAL LANGUAGES, AUTOMATA AND COMPUTABILITY
15-453 FORMAL LANGUAGES, AUTOMATA AND COMPUTABILITY REVIEW for MIDTERM 1 THURSDAY Feb 6 Midterm 1 will cover everything we have seen so far The PROBLEMS will be from Sipser, Chapters 1, 2, 3 It will be
More informationOn the Accepting Power of 2-Tape Büchi Automata
On the Accepting Power of 2-Tape Büchi Automata Equipe de Logique Mathématique Université Paris 7 STACS 2006 Acceptance of infinite words In the sixties, Acceptance of infinite words by finite automata
More informationThe Rational Subset Membership Problem for Groups: A Survey
The Rational Subset Membership Problem for Groups: A Survey Markus Lohrey University of Siegen December 18, 2013 Abstract The class of rational subsets of a group G is the smallest class that contains
More informationLecture Notes on Inductive Definitions
Lecture Notes on Inductive Definitions 15-312: Foundations of Programming Languages Frank Pfenning Lecture 2 September 2, 2004 These supplementary notes review the notion of an inductive definition and
More informationNODIA AND COMPANY. GATE SOLVED PAPER Computer Science Engineering Theory of Computation. Copyright By NODIA & COMPANY
No part of this publication may be reproduced or distributed in any form or any means, electronic, mechanical, photocopying, or otherwise without the prior permission of the author. GATE SOLVED PAPER Computer
More informationMA/CSSE 474 Theory of Computation
MA/CSSE 474 Theory of Computation CFL Hierarchy CFL Decision Problems Your Questions? Previous class days' material Reading Assignments HW 12 or 13 problems Anything else I have included some slides online
More informationOgden s Lemma for CFLs
Ogden s Lemma for CFLs Theorem If L is a context-free language, then there exists an integer l such that for any u L with at least l positions marked, u can be written as u = vwxyz such that 1 x and at
More information