Characterizations of Bounded Semilinear Languages by One-way and Two-way Deterministic Machines Oscar H. Ibarra 1 and Shinnosuke Seki 2 1. Department of.

Slides:

Advertisements

Similar presentations

Formal Languages: main findings so far A problem can be formalised as a formal language A formal language can be defined in various ways, e.g.: the language.

Advertisements

CS 345: Chapter 9 Algorithmic Universality and Its Robustness

Pushdown Automata Section 2.2 CSC 4170 Theory of Computation.

Recap CS605: The Mathematics and Theory of Computer Science.

Complexity 25-1 Complexity Andrei Bulatov #P-Completeness.

CS21 Decidability and Tractability

CFG => PDA Sipser 2 (pages ).

CFG => PDA Sipser 2 (pages ). CS 311 Fall Formally… A pushdown automaton is a sextuple M = (Q, Σ, Γ, δ, q 0, F), where – Q is a finite set.

Courtesy Costas Busch - RPI1 Non Deterministic Automata.

1 Linear Bounded Automata LBAs. 2 Linear Bounded Automata are like Turing Machines with a restriction: The working space of the tape is the space of the.

Dr. Muhammed Al-Mulhem 1ICS ICS 535 Design and Implementation of Programming Languages Part 1 Computability (Chapter 2) ICS 535 Design and Implementation.

Reachability Analysis for Some Models of Infinite-State Transition Systems Oscar H. Ibarra, Tevfik Bultan, and Jianwen Su Department of Computer Science.

Foundations of (Theoretical) Computer Science Chapter 2 Lecture Notes (Section 2.2: Pushdown Automata) Prof. Karen Daniels, Fall 2009 with acknowledgement.

Linear Bounded Automata LBAs

Costas Busch - RPI1 CSCI-2400 Models of Computation.

Fall 2006Costas Busch - RPI1 The Chomsky Hierarchy.

Fall 2003Costas Busch - RPI1 Turing Machines (TMs) Linear Bounded Automata (LBAs)

Grammars, Languages and Finite-state automata Languages are described by grammars We need an algorithm that takes as input grammar sentence And gives a.

FORMAL LANGUAGES, AUTOMATA AND COMPUTABILITY

Final Exam Review Cummulative Chapters 0, 1, 2, 3, 4, 5 and 7.

1 Theory of Computation 計算理論 2 Instructor: 顏嗣鈞 Web: Time: 9:10-12:10 PM, Monday Place: BL 103.

Introduction to the Theory of Computation

1Computer Sciences Department. Book: INTRODUCTION TO THE THEORY OF COMPUTATION, SECOND EDITION, by: MICHAEL SIPSER Reference 3Computer Sciences Department.

Complexity theory and combinatorial optimization Class #2 – 17 th of March …. where we deal with decision problems, finite automata, Turing machines pink.

Pushdown Automata (PDAs)

Saeid Pashzadeh Jan 2009 Theory of Computation 1.

Security of Numerical Sensors in Finite Automata Zhe Dang Dmitry Dementyev Thomas R. Fischer William J. Hutton, III Washington State University – Pullman,

1 Theory of Computation 計算理論 2 Instructor: 顏嗣鈞 Web: Time: 9:10-12:10 PM, Monday Place: BL.

Models of Computation. Computation: Computation is a general term for any type of information processing information processing CPU memory.

1 Linear Bounded Automata LBAs. 2 Linear Bounded Automata (LBAs) are the same as Turing Machines with one difference: The input string tape space is the.

1Computer Sciences Department. Book: INTRODUCTION TO THE THEORY OF COMPUTATION, SECOND EDITION, by: MICHAEL SIPSER Reference 3Computer Sciences Department.

D E C I D A B I L I T Y 1. 2 Objectives To investigate the power of algorithms to solve problems. To explore the limits of algorithmic solvability. To.

Foundations of (Theoretical) Computer Science Chapter 2 Lecture Notes (Section 2.2: Pushdown Automata) Prof. Karen Daniels, Fall 2010 with acknowledgement.

CS130: Theory of Computation An introductory course on the theory of automata and formal languages: models of machines, languages and grammars, relationship.

CSCI 3130: Automata theory and formal languages Andrej Bogdanov The Chinese University of Hong Kong Pushdown.

Composability of Infinite-State Activity Automata* Zhe Dang 1, Oscar H. Ibarra 2, Jianwen Su 2 1 Washington State University, Pullman 2 University of California,

1 Linear Bounded Automata LBAs. 2 Linear Bounded Automata (LBAs) are the same as Turing Machines with one difference: The input string tape space is the.

1.Draw a parse tree for the following derivation: S  C A C  C A b b  b b A b b  b b B b b  b b a A a a b b  b b a b a a b b 2. Show on your parse.

1.Draw a parse tree for the following derivation: S  C A C  C A b b  b b A b b  b b B b b  b b a A a a b b  b b a b a a b b 2. Show on your parse.

CS6800 Advance Theory of Computation Spring 2016 Nasser Alsaedi

Theory of Computation. Introduction to The Course Lectures: Room ( Sun. & Tue.: 8 am – 9:30 am) Instructor: Dr. Ayman Srour (Ph.D. in Computer Science).

1/29/02CSE460 - MSU1 Nondeterminism-NFA Section 4.1 of Martin Textbook CSE460 – Computability & Formal Language Theory Comp. Science & Engineering Michigan.

Review : Theory of Computation. Regular Language and Finite Automata Context-free Language and Pushdown Automata Turing Machine and Recursive Enumerable.

Theory of Languages and Automata By: Mojtaba Khezrian.

Formal Foundations-II [Theory of Automata]

Introduction to the Theory of Computation

Non Deterministic Automata

Linear Bounded Automata LBAs

Pushdown Automata PDAs

Pushdown Automata PDAs

Pushdown Automata PDAs

Pushdown Automata PDAs

Course 2 Introduction to Formal Languages and Automata Theory (part 2)

CSE322 Chomsky classification

CSE322 The Chomsky Hierarchy

RAJALAKSHMI ENGINEERING COLLEGE

Jaya Krishna, M.Tech, Assistant Professor

By John E. Hopcroft, Rajeev Motwani and Jeffrey D. Ullman

CSCI-2400 Models of Computation Costas Busch - RPI.

Non-Deterministic Finite Automata

Non-Deterministic Finite Automata

CSE322 Definition and description of finite Automata

Non Deterministic Automata

Chapter 1 Regular Language

Sub: Theoretical Foundations of Computer Sciences

Theoretical Foundations of Computer Sciences

The Chomsky Hierarchy Costas Busch - LSU.

Non Deterministic Automata

Presentation transcript:

Characterizations of Bounded Semilinear Languages by One-way and Two-way Deterministic Machines Oscar H. Ibarra 1 and Shinnosuke Seki 2 1. Department of Computer Science, University of California, Santa Barbara, USA 2. Department of Systems Biosciences for Drug Discovery, Kyoto University, Japan

Conceptual diagram of a counter machine 2011/8/18Automata and Formal Languages (AFL 2011)2 finite state control a b input tape p c1c1 c2c2 ckck can be tested for zero counters …

Conceptual diagram of a counter machine 2011/8/18Automata and Formal Languages (AFL 2011)3 finite state control a b input tape p c1c1 c2c2 ckck can be tested for zero counters q …

Variants of counter machine 2011/8/18Automata and Formal Languages (AFL 2011)4 finite state control a b input tape p c1c1 c2c2 ckck counters … Pushdown counter machines 2-way counter machines stack end markers

Formal definition of pushdown counter machines 2011/8/18Automata and Formal Languages (AFL 2011)5

Reversal-bounded counter machines 2011/8/18Automata and Formal Languages (AFL 2011)6 Definition [Baker and Book 1974, Ibarra 1978]Definition (Equivalent * ) A finite automaton augmented with 2 counters is Turing-complete. [Minsky 1961] * This equivalence needs a help of finite state control to remember how many reversals each counter has made.

2011/8/18Automata and Formal Languages (AFL 2011)7 Lemma

Classes of counter machines 2011/8/18Automata and Formal Languages (AFL 2011)8

Classes of counter machines (cont.) 2011/8/18Automata and Formal Languages (AFL 2011)9

Semilinear sets 2011/8/18Automata and Formal Languages (AFL 2011)10

Bounded semilinear languages 2011/8/18Automata and Formal Languages (AFL 2011)11 Definition

Finite-turn machines 2011/8/18Automata and Formal Languages (AFL 2011)12 Finite-turnFinite-crossing Finite-turn Finite-crossing

Main theorem 2011/8/18Automata and Formal Languages (AFL 2011)13 Main Theorem

Main theorem 2011/8/18Automata and Formal Languages (AFL 2011)14 Main Theorem

2011/8/18Automata and Formal Languages (AFL 2011)15 Language Accepted by result 1 [Ibarra 78] Use result 1 and non- deterministic guess. Linear Diophantine- equations turn out to be solvable by these machines

Letter-bounded to bounded 2011/8/18Automata and Formal Languages (AFL 2011)16

2011/8/18Automata and Formal Languages (AFL 2011)17 Language Accepted by result 1 [Ibarra 78] Use result 1 and non- deterministic guess. Linear Diophantine- equations turn out to be solvable by these machines How can a deterministic machine non-deterministic decompose an input? Our answer is “ this decomposition does not require nondeterminism. ”

Deterministic decomposition 2011/8/18Automata and Formal Languages (AFL 2011)18 Theorem [Fine and Wilf 1965]

Main theorem 2011/8/18Automata and Formal Languages (AFL 2011)19 Main Theorem

2011/8/18Automata and Formal Languages (AFL 2011)20 Lemma stack

2011/8/18Automata and Formal Languages (AFL 2011)21 Lemma

2011/8/18Automata and Formal Languages (AFL 2011)22 Theorem

Main theorem 2011/8/18Automata and Formal Languages (AFL 2011)23 Main Theorem (Proved!!) Open

Acknowledgements This research was supported by National Science Foundation Grant Natural Sciences and Engineering Research Council of Canada Discovery Grant and Canada Research Chair Award in Biocomputing to Lila Kari Funding Program for Next Generation World-Leading Researchers (NEXT Program) to Yasushi Okuno 2011/8/1824Automata and Formal Languages (AFL 2011)

References 2011/8/18Automata and Formal Languages (AFL 2011)25 [Baker and Book 1974] B. S. Baker and R. V. Book. Reversal-bounded multipushdown machines. Journal of Computer and System Sciences 8: , [Fine and Wilf 1965] N. J. Fine and H. S. Wilf. Uniqueness theorem for periodic functions. Proc. Of the American Mathematical Society 16: , [Ibarra 1978] O. H. Ibarra. Reversal-bounded multicounter machines and their decision problems. Journal of the ACM 25: , 1978.

References 2011/8/18Automata and Formal Languages (AFL 2011)26 [Minsky 1961] M. L. Minsky. Recursive unsolvability of Post’s problem of “tag” and other topics in theory of turing machines. Annals of Mathematics 74: , 1961.