Enviar pesquisa
Carregar
Parallel communicating flip pushdown automata systems communicating by stacks
•
0 gostou
•
323 visualizações
IAEME Publication
Seguir
Denunciar
Compartilhar
Denunciar
Compartilhar
1 de 12
Baixar agora
Baixar para ler offline
Recomendados
Theory of Automata and formal languages Unit 5
Theory of Automata and formal languages Unit 5
Abhimanyu Mishra
06 recurrent neural_networks
06 recurrent neural_networks
Andres Mendez-Vazquez
Chapter 24 aoa
Chapter 24 aoa
Hanif Durad
Lec09- AI
Lec09- AI
drmbalu
Computational Complexity: Introduction-Turing Machines-Undecidability
Computational Complexity: Introduction-Turing Machines-Undecidability
Antonis Antonopoulos
Simulating Turing Machines Using Colored Petri Nets with Priority Transitions
Simulating Turing Machines Using Colored Petri Nets with Priority Transitions
idescitation
Computational Complexity: Oracles and the Polynomial Hierarchy
Computational Complexity: Oracles and the Polynomial Hierarchy
Antonis Antonopoulos
Algorithmics on SLP-compressed strings
Algorithmics on SLP-compressed strings
Antonis Antonopoulos
Recomendados
Theory of Automata and formal languages Unit 5
Theory of Automata and formal languages Unit 5
Abhimanyu Mishra
06 recurrent neural_networks
06 recurrent neural_networks
Andres Mendez-Vazquez
Chapter 24 aoa
Chapter 24 aoa
Hanif Durad
Lec09- AI
Lec09- AI
drmbalu
Computational Complexity: Introduction-Turing Machines-Undecidability
Computational Complexity: Introduction-Turing Machines-Undecidability
Antonis Antonopoulos
Simulating Turing Machines Using Colored Petri Nets with Priority Transitions
Simulating Turing Machines Using Colored Petri Nets with Priority Transitions
idescitation
Computational Complexity: Oracles and the Polynomial Hierarchy
Computational Complexity: Oracles and the Polynomial Hierarchy
Antonis Antonopoulos
Algorithmics on SLP-compressed strings
Algorithmics on SLP-compressed strings
Antonis Antonopoulos
[Download] rev chapter-9-june26th
[Download] rev chapter-9-june26th
ATC, ECE, Hong Kong University of Science and Technology
Computational Complexity: Complexity Classes
Computational Complexity: Complexity Classes
Antonis Antonopoulos
Stability of adaptive random-walk Metropolis algorithms
Stability of adaptive random-walk Metropolis algorithms
BigMC
Quantum Algorithms and Lower Bounds in Continuous Time
Quantum Algorithms and Lower Bounds in Continuous Time
David Yonge-Mallo
NP completeness
NP completeness
Amrinder Arora
Lecture 8
Lecture 8
Krishna Karri
P, NP, NP-Complete, and NP-Hard
P, NP, NP-Complete, and NP-Hard
Animesh Chaturvedi
Chapter 23 aoa
Chapter 23 aoa
Hanif Durad
[Download] Rev-Chapter-3
[Download] Rev-Chapter-3
ATC, ECE, Hong Kong University of Science and Technology
Chapter 26 aoa
Chapter 26 aoa
Hanif Durad
Computability - Tractable, Intractable and Non-computable Function
Computability - Tractable, Intractable and Non-computable Function
Reggie Niccolo Santos
Computability, turing machines and lambda calculus
Computability, turing machines and lambda calculus
Edward Blurock
Performance analysis of bangla speech recognizer model using hmm
Performance analysis of bangla speech recognizer model using hmm
Abdullah al Mamun
Np cooks theorem
Np cooks theorem
Narayana Galla
Chapter 25 aoa
Chapter 25 aoa
Hanif Durad
Ss
Ss
Sreenadh Naga Venkata
Inversion Theorem for Generalized Fractional Hilbert Transform
Inversion Theorem for Generalized Fractional Hilbert Transform
inventionjournals
Introduction to Fourier transform and signal analysis
Introduction to Fourier transform and signal analysis
宗翰 謝
Writing a SAT solver as a hobby project
Writing a SAT solver as a hobby project
Masahiro Sakai
A brief introduction to Hartree-Fock and TDDFT
A brief introduction to Hartree-Fock and TDDFT
Jiahao Chen
Face recognition across pose with estimation of pose parameters
Face recognition across pose with estimation of pose parameters
IAEME Publication
Facial expression using 3 d animation
Facial expression using 3 d animation
IAEME Publication
Mais conteúdo relacionado
Mais procurados
[Download] rev chapter-9-june26th
[Download] rev chapter-9-june26th
ATC, ECE, Hong Kong University of Science and Technology
Computational Complexity: Complexity Classes
Computational Complexity: Complexity Classes
Antonis Antonopoulos
Stability of adaptive random-walk Metropolis algorithms
Stability of adaptive random-walk Metropolis algorithms
BigMC
Quantum Algorithms and Lower Bounds in Continuous Time
Quantum Algorithms and Lower Bounds in Continuous Time
David Yonge-Mallo
NP completeness
NP completeness
Amrinder Arora
Lecture 8
Lecture 8
Krishna Karri
P, NP, NP-Complete, and NP-Hard
P, NP, NP-Complete, and NP-Hard
Animesh Chaturvedi
Chapter 23 aoa
Chapter 23 aoa
Hanif Durad
[Download] Rev-Chapter-3
[Download] Rev-Chapter-3
ATC, ECE, Hong Kong University of Science and Technology
Chapter 26 aoa
Chapter 26 aoa
Hanif Durad
Computability - Tractable, Intractable and Non-computable Function
Computability - Tractable, Intractable and Non-computable Function
Reggie Niccolo Santos
Computability, turing machines and lambda calculus
Computability, turing machines and lambda calculus
Edward Blurock
Performance analysis of bangla speech recognizer model using hmm
Performance analysis of bangla speech recognizer model using hmm
Abdullah al Mamun
Np cooks theorem
Np cooks theorem
Narayana Galla
Chapter 25 aoa
Chapter 25 aoa
Hanif Durad
Ss
Ss
Sreenadh Naga Venkata
Inversion Theorem for Generalized Fractional Hilbert Transform
Inversion Theorem for Generalized Fractional Hilbert Transform
inventionjournals
Introduction to Fourier transform and signal analysis
Introduction to Fourier transform and signal analysis
宗翰 謝
Writing a SAT solver as a hobby project
Writing a SAT solver as a hobby project
Masahiro Sakai
A brief introduction to Hartree-Fock and TDDFT
A brief introduction to Hartree-Fock and TDDFT
Jiahao Chen
Mais procurados
(20)
[Download] rev chapter-9-june26th
[Download] rev chapter-9-june26th
Computational Complexity: Complexity Classes
Computational Complexity: Complexity Classes
Stability of adaptive random-walk Metropolis algorithms
Stability of adaptive random-walk Metropolis algorithms
Quantum Algorithms and Lower Bounds in Continuous Time
Quantum Algorithms and Lower Bounds in Continuous Time
NP completeness
NP completeness
Lecture 8
Lecture 8
P, NP, NP-Complete, and NP-Hard
P, NP, NP-Complete, and NP-Hard
Chapter 23 aoa
Chapter 23 aoa
[Download] Rev-Chapter-3
[Download] Rev-Chapter-3
Chapter 26 aoa
Chapter 26 aoa
Computability - Tractable, Intractable and Non-computable Function
Computability - Tractable, Intractable and Non-computable Function
Computability, turing machines and lambda calculus
Computability, turing machines and lambda calculus
Performance analysis of bangla speech recognizer model using hmm
Performance analysis of bangla speech recognizer model using hmm
Np cooks theorem
Np cooks theorem
Chapter 25 aoa
Chapter 25 aoa
Ss
Ss
Inversion Theorem for Generalized Fractional Hilbert Transform
Inversion Theorem for Generalized Fractional Hilbert Transform
Introduction to Fourier transform and signal analysis
Introduction to Fourier transform and signal analysis
Writing a SAT solver as a hobby project
Writing a SAT solver as a hobby project
A brief introduction to Hartree-Fock and TDDFT
A brief introduction to Hartree-Fock and TDDFT
Destaque
Face recognition across pose with estimation of pose parameters
Face recognition across pose with estimation of pose parameters
IAEME Publication
Facial expression using 3 d animation
Facial expression using 3 d animation
IAEME Publication
Summer school social media 2013 - Sociale Media vd Toekomst
Summer school social media 2013 - Sociale Media vd Toekomst
Arno Visser
A design procedure for active rectangular microstrip patch antenna
A design procedure for active rectangular microstrip patch antenna
IAEME Publication
Knowledge management strategies in higher education
Knowledge management strategies in higher education
IAEME Publication
Early detection of adult valve disease mitral stenosis
Early detection of adult valve disease mitral stenosis
IAEME Publication
Portfolio digital edmir amador
Portfolio digital edmir amador
Dulce Gomes
Job satisfaction in banking a study of private and public sector banks
Job satisfaction in banking a study of private and public sector banks
IAEME Publication
áLbum de fotos
áLbum de fotos
jdiazmo12388
Destaque
(9)
Face recognition across pose with estimation of pose parameters
Face recognition across pose with estimation of pose parameters
Facial expression using 3 d animation
Facial expression using 3 d animation
Summer school social media 2013 - Sociale Media vd Toekomst
Summer school social media 2013 - Sociale Media vd Toekomst
A design procedure for active rectangular microstrip patch antenna
A design procedure for active rectangular microstrip patch antenna
Knowledge management strategies in higher education
Knowledge management strategies in higher education
Early detection of adult valve disease mitral stenosis
Early detection of adult valve disease mitral stenosis
Portfolio digital edmir amador
Portfolio digital edmir amador
Job satisfaction in banking a study of private and public sector banks
Job satisfaction in banking a study of private and public sector banks
áLbum de fotos
áLbum de fotos
Semelhante a Parallel communicating flip pushdown automata systems communicating by stacks
Parallel communicating extended finite automata systems
Parallel communicating extended finite automata systems
iaemedu
Parallel communicating extended finite automata systems communicating by states
Parallel communicating extended finite automata systems communicating by states
IAEME Publication
Parallel communicating extended finite automata systems
Parallel communicating extended finite automata systems
iaemedu
Some properties of m sequences over finite field fp
Some properties of m sequences over finite field fp
IAEME Publication
Chapter10. Realization of Digital Filter.pptx
Chapter10. Realization of Digital Filter.pptx
RajGopalMishra4
FUZZY DIAGONAL OPTIMAL ALGORITHM TO SOLVE INTUITIONISTIC FUZZY ASSIGNMENT PRO...
FUZZY DIAGONAL OPTIMAL ALGORITHM TO SOLVE INTUITIONISTIC FUZZY ASSIGNMENT PRO...
IAEME Publication
Stabilization of linear time invariant systems, Factorization Approach
Stabilization of linear time invariant systems, Factorization Approach
Solo Hermelin
On the principle of optimality for linear stochastic dynamic system
On the principle of optimality for linear stochastic dynamic system
ijfcstjournal
On the Principle of Optimality for Linear Stochastic Dynamic System
On the Principle of Optimality for Linear Stochastic Dynamic System
ijfcstjournal
Abstract— To be able to control a robot manipulator as.docx
Abstract— To be able to control a robot manipulator as.docx
aryan532920
Control Analysis of a mass- loaded String
Control Analysis of a mass- loaded String
AM Publications
A SOFTWARE TOOL FOR LIVE-LOCK AVOIDANCE IN SYSTEMS MODELLED USING A CLASS OF ...
A SOFTWARE TOOL FOR LIVE-LOCK AVOIDANCE IN SYSTEMS MODELLED USING A CLASS OF ...
IJCSEA Journal
A C LOUD -B ASED P ROTOTYPE I MPLEMENTATION OF A D ISEASE O UTBREAK N O...
A C LOUD -B ASED P ROTOTYPE I MPLEMENTATION OF A D ISEASE O UTBREAK N O...
IJCSEA Journal
A C OMPREHENSIVE S URVEY O N P ERFORMANCE A NALYSIS O F C HAOTIC C OLOU...
A C OMPREHENSIVE S URVEY O N P ERFORMANCE A NALYSIS O F C HAOTIC C OLOU...
IJITCA Journal
C OMPREHENSIVE S URVEY O N P ERFORMANCE A NALYSIS O F C HAOTIC C OLOUR...
C OMPREHENSIVE S URVEY O N P ERFORMANCE A NALYSIS O F C HAOTIC C OLOUR...
IJITCA Journal
PROTOTYPE APPLICATION IN ANDROID PLATFORM FOR SYSTEM ADMINISTRATION OF HPC ...
PROTOTYPE APPLICATION IN ANDROID PLATFORM FOR SYSTEM ADMINISTRATION OF HPC ...
IJITCA Journal
A S OFTWARE T OOL FOR L IVE - LOCK A VOIDANCE IN S YSTEMS M ODELLED USIN...
A S OFTWARE T OOL FOR L IVE - LOCK A VOIDANCE IN S YSTEMS M ODELLED USIN...
IJCSEA Journal
signals and systems chapter3-part3_signals and systems chapter3-part3.pdf
signals and systems chapter3-part3_signals and systems chapter3-part3.pdf
islamsharawneh
An improved ant colony algorithm based on
An improved ant colony algorithm based on
IJCI JOURNAL
Welcome to International Journal of Engineering Research and Development (IJERD)
Welcome to International Journal of Engineering Research and Development (IJERD)
IJERD Editor
Semelhante a Parallel communicating flip pushdown automata systems communicating by stacks
(20)
Parallel communicating extended finite automata systems
Parallel communicating extended finite automata systems
Parallel communicating extended finite automata systems communicating by states
Parallel communicating extended finite automata systems communicating by states
Parallel communicating extended finite automata systems
Parallel communicating extended finite automata systems
Some properties of m sequences over finite field fp
Some properties of m sequences over finite field fp
Chapter10. Realization of Digital Filter.pptx
Chapter10. Realization of Digital Filter.pptx
FUZZY DIAGONAL OPTIMAL ALGORITHM TO SOLVE INTUITIONISTIC FUZZY ASSIGNMENT PRO...
FUZZY DIAGONAL OPTIMAL ALGORITHM TO SOLVE INTUITIONISTIC FUZZY ASSIGNMENT PRO...
Stabilization of linear time invariant systems, Factorization Approach
Stabilization of linear time invariant systems, Factorization Approach
On the principle of optimality for linear stochastic dynamic system
On the principle of optimality for linear stochastic dynamic system
On the Principle of Optimality for Linear Stochastic Dynamic System
On the Principle of Optimality for Linear Stochastic Dynamic System
Abstract— To be able to control a robot manipulator as.docx
Abstract— To be able to control a robot manipulator as.docx
Control Analysis of a mass- loaded String
Control Analysis of a mass- loaded String
A SOFTWARE TOOL FOR LIVE-LOCK AVOIDANCE IN SYSTEMS MODELLED USING A CLASS OF ...
A SOFTWARE TOOL FOR LIVE-LOCK AVOIDANCE IN SYSTEMS MODELLED USING A CLASS OF ...
A C LOUD -B ASED P ROTOTYPE I MPLEMENTATION OF A D ISEASE O UTBREAK N O...
A C LOUD -B ASED P ROTOTYPE I MPLEMENTATION OF A D ISEASE O UTBREAK N O...
A C OMPREHENSIVE S URVEY O N P ERFORMANCE A NALYSIS O F C HAOTIC C OLOU...
A C OMPREHENSIVE S URVEY O N P ERFORMANCE A NALYSIS O F C HAOTIC C OLOU...
C OMPREHENSIVE S URVEY O N P ERFORMANCE A NALYSIS O F C HAOTIC C OLOUR...
C OMPREHENSIVE S URVEY O N P ERFORMANCE A NALYSIS O F C HAOTIC C OLOUR...
PROTOTYPE APPLICATION IN ANDROID PLATFORM FOR SYSTEM ADMINISTRATION OF HPC ...
PROTOTYPE APPLICATION IN ANDROID PLATFORM FOR SYSTEM ADMINISTRATION OF HPC ...
A S OFTWARE T OOL FOR L IVE - LOCK A VOIDANCE IN S YSTEMS M ODELLED USIN...
A S OFTWARE T OOL FOR L IVE - LOCK A VOIDANCE IN S YSTEMS M ODELLED USIN...
signals and systems chapter3-part3_signals and systems chapter3-part3.pdf
signals and systems chapter3-part3_signals and systems chapter3-part3.pdf
An improved ant colony algorithm based on
An improved ant colony algorithm based on
Welcome to International Journal of Engineering Research and Development (IJERD)
Welcome to International Journal of Engineering Research and Development (IJERD)
Mais de IAEME Publication
IAEME_Publication_Call_for_Paper_September_2022.pdf
IAEME_Publication_Call_for_Paper_September_2022.pdf
IAEME Publication
MODELING AND ANALYSIS OF SURFACE ROUGHNESS AND WHITE LATER THICKNESS IN WIRE-...
MODELING AND ANALYSIS OF SURFACE ROUGHNESS AND WHITE LATER THICKNESS IN WIRE-...
IAEME Publication
A STUDY ON THE REASONS FOR TRANSGENDER TO BECOME ENTREPRENEURS
A STUDY ON THE REASONS FOR TRANSGENDER TO BECOME ENTREPRENEURS
IAEME Publication
BROAD UNEXPOSED SKILLS OF TRANSGENDER ENTREPRENEURS
BROAD UNEXPOSED SKILLS OF TRANSGENDER ENTREPRENEURS
IAEME Publication
DETERMINANTS AFFECTING THE USER'S INTENTION TO USE MOBILE BANKING APPLICATIONS
DETERMINANTS AFFECTING THE USER'S INTENTION TO USE MOBILE BANKING APPLICATIONS
IAEME Publication
ANALYSE THE USER PREDILECTION ON GPAY AND PHONEPE FOR DIGITAL TRANSACTIONS
ANALYSE THE USER PREDILECTION ON GPAY AND PHONEPE FOR DIGITAL TRANSACTIONS
IAEME Publication
VOICE BASED ATM FOR VISUALLY IMPAIRED USING ARDUINO
VOICE BASED ATM FOR VISUALLY IMPAIRED USING ARDUINO
IAEME Publication
IMPACT OF EMOTIONAL INTELLIGENCE ON HUMAN RESOURCE MANAGEMENT PRACTICES AMONG...
IMPACT OF EMOTIONAL INTELLIGENCE ON HUMAN RESOURCE MANAGEMENT PRACTICES AMONG...
IAEME Publication
VISUALISING AGING PARENTS & THEIR CLOSE CARERS LIFE JOURNEY IN AGING ECONOMY
VISUALISING AGING PARENTS & THEIR CLOSE CARERS LIFE JOURNEY IN AGING ECONOMY
IAEME Publication
A STUDY ON THE IMPACT OF ORGANIZATIONAL CULTURE ON THE EFFECTIVENESS OF PERFO...
A STUDY ON THE IMPACT OF ORGANIZATIONAL CULTURE ON THE EFFECTIVENESS OF PERFO...
IAEME Publication
GANDHI ON NON-VIOLENT POLICE
GANDHI ON NON-VIOLENT POLICE
IAEME Publication
A STUDY ON TALENT MANAGEMENT AND ITS IMPACT ON EMPLOYEE RETENTION IN SELECTED...
A STUDY ON TALENT MANAGEMENT AND ITS IMPACT ON EMPLOYEE RETENTION IN SELECTED...
IAEME Publication
ATTRITION IN THE IT INDUSTRY DURING COVID-19 PANDEMIC: LINKING EMOTIONAL INTE...
ATTRITION IN THE IT INDUSTRY DURING COVID-19 PANDEMIC: LINKING EMOTIONAL INTE...
IAEME Publication
INFLUENCE OF TALENT MANAGEMENT PRACTICES ON ORGANIZATIONAL PERFORMANCE A STUD...
INFLUENCE OF TALENT MANAGEMENT PRACTICES ON ORGANIZATIONAL PERFORMANCE A STUD...
IAEME Publication
A STUDY OF VARIOUS TYPES OF LOANS OF SELECTED PUBLIC AND PRIVATE SECTOR BANKS...
A STUDY OF VARIOUS TYPES OF LOANS OF SELECTED PUBLIC AND PRIVATE SECTOR BANKS...
IAEME Publication
EXPERIMENTAL STUDY OF MECHANICAL AND TRIBOLOGICAL RELATION OF NYLON/BaSO4 POL...
EXPERIMENTAL STUDY OF MECHANICAL AND TRIBOLOGICAL RELATION OF NYLON/BaSO4 POL...
IAEME Publication
ROLE OF SOCIAL ENTREPRENEURSHIP IN RURAL DEVELOPMENT OF INDIA - PROBLEMS AND ...
ROLE OF SOCIAL ENTREPRENEURSHIP IN RURAL DEVELOPMENT OF INDIA - PROBLEMS AND ...
IAEME Publication
OPTIMAL RECONFIGURATION OF POWER DISTRIBUTION RADIAL NETWORK USING HYBRID MET...
OPTIMAL RECONFIGURATION OF POWER DISTRIBUTION RADIAL NETWORK USING HYBRID MET...
IAEME Publication
APPLICATION OF FRUGAL APPROACH FOR PRODUCTIVITY IMPROVEMENT - A CASE STUDY OF...
APPLICATION OF FRUGAL APPROACH FOR PRODUCTIVITY IMPROVEMENT - A CASE STUDY OF...
IAEME Publication
A MULTIPLE – CHANNEL QUEUING MODELS ON FUZZY ENVIRONMENT
A MULTIPLE – CHANNEL QUEUING MODELS ON FUZZY ENVIRONMENT
IAEME Publication
Mais de IAEME Publication
(20)
IAEME_Publication_Call_for_Paper_September_2022.pdf
IAEME_Publication_Call_for_Paper_September_2022.pdf
MODELING AND ANALYSIS OF SURFACE ROUGHNESS AND WHITE LATER THICKNESS IN WIRE-...
MODELING AND ANALYSIS OF SURFACE ROUGHNESS AND WHITE LATER THICKNESS IN WIRE-...
A STUDY ON THE REASONS FOR TRANSGENDER TO BECOME ENTREPRENEURS
A STUDY ON THE REASONS FOR TRANSGENDER TO BECOME ENTREPRENEURS
BROAD UNEXPOSED SKILLS OF TRANSGENDER ENTREPRENEURS
BROAD UNEXPOSED SKILLS OF TRANSGENDER ENTREPRENEURS
DETERMINANTS AFFECTING THE USER'S INTENTION TO USE MOBILE BANKING APPLICATIONS
DETERMINANTS AFFECTING THE USER'S INTENTION TO USE MOBILE BANKING APPLICATIONS
ANALYSE THE USER PREDILECTION ON GPAY AND PHONEPE FOR DIGITAL TRANSACTIONS
ANALYSE THE USER PREDILECTION ON GPAY AND PHONEPE FOR DIGITAL TRANSACTIONS
VOICE BASED ATM FOR VISUALLY IMPAIRED USING ARDUINO
VOICE BASED ATM FOR VISUALLY IMPAIRED USING ARDUINO
IMPACT OF EMOTIONAL INTELLIGENCE ON HUMAN RESOURCE MANAGEMENT PRACTICES AMONG...
IMPACT OF EMOTIONAL INTELLIGENCE ON HUMAN RESOURCE MANAGEMENT PRACTICES AMONG...
VISUALISING AGING PARENTS & THEIR CLOSE CARERS LIFE JOURNEY IN AGING ECONOMY
VISUALISING AGING PARENTS & THEIR CLOSE CARERS LIFE JOURNEY IN AGING ECONOMY
A STUDY ON THE IMPACT OF ORGANIZATIONAL CULTURE ON THE EFFECTIVENESS OF PERFO...
A STUDY ON THE IMPACT OF ORGANIZATIONAL CULTURE ON THE EFFECTIVENESS OF PERFO...
GANDHI ON NON-VIOLENT POLICE
GANDHI ON NON-VIOLENT POLICE
A STUDY ON TALENT MANAGEMENT AND ITS IMPACT ON EMPLOYEE RETENTION IN SELECTED...
A STUDY ON TALENT MANAGEMENT AND ITS IMPACT ON EMPLOYEE RETENTION IN SELECTED...
ATTRITION IN THE IT INDUSTRY DURING COVID-19 PANDEMIC: LINKING EMOTIONAL INTE...
ATTRITION IN THE IT INDUSTRY DURING COVID-19 PANDEMIC: LINKING EMOTIONAL INTE...
INFLUENCE OF TALENT MANAGEMENT PRACTICES ON ORGANIZATIONAL PERFORMANCE A STUD...
INFLUENCE OF TALENT MANAGEMENT PRACTICES ON ORGANIZATIONAL PERFORMANCE A STUD...
A STUDY OF VARIOUS TYPES OF LOANS OF SELECTED PUBLIC AND PRIVATE SECTOR BANKS...
A STUDY OF VARIOUS TYPES OF LOANS OF SELECTED PUBLIC AND PRIVATE SECTOR BANKS...
EXPERIMENTAL STUDY OF MECHANICAL AND TRIBOLOGICAL RELATION OF NYLON/BaSO4 POL...
EXPERIMENTAL STUDY OF MECHANICAL AND TRIBOLOGICAL RELATION OF NYLON/BaSO4 POL...
ROLE OF SOCIAL ENTREPRENEURSHIP IN RURAL DEVELOPMENT OF INDIA - PROBLEMS AND ...
ROLE OF SOCIAL ENTREPRENEURSHIP IN RURAL DEVELOPMENT OF INDIA - PROBLEMS AND ...
OPTIMAL RECONFIGURATION OF POWER DISTRIBUTION RADIAL NETWORK USING HYBRID MET...
OPTIMAL RECONFIGURATION OF POWER DISTRIBUTION RADIAL NETWORK USING HYBRID MET...
APPLICATION OF FRUGAL APPROACH FOR PRODUCTIVITY IMPROVEMENT - A CASE STUDY OF...
APPLICATION OF FRUGAL APPROACH FOR PRODUCTIVITY IMPROVEMENT - A CASE STUDY OF...
A MULTIPLE – CHANNEL QUEUING MODELS ON FUZZY ENVIRONMENT
A MULTIPLE – CHANNEL QUEUING MODELS ON FUZZY ENVIRONMENT
Parallel communicating flip pushdown automata systems communicating by stacks
1.
International Journal of
Computer Engineering (IJCET), ISSN 0976 – 6367(Print), International Journal of Computer Engineering and Technology and Technology (IJCET), ISSN 0976 1, May - June (2010), © IAEME ISSN 0976 – 6375(Online) Volume 1, Number – 6367(Print) ISSN 0976 – 6375(Online) Volume 1 IJCET Number 1, May - June (2010), pp. 34-45 ©IAEME © IAEME, http://www.iaeme.com/ijcet.html PARALLEL COMMUNICATING FLIP PUSHDOWN AUTOMATA SYSTEMS COMMUNICATING BY STACKS M.Ramakrishnan Research Scholar Anna University of Technology, Coimbatore Coimbatore – 641 047 S.Balasubramanian Research Scholar Anna University of Technology, Coimbatore Coimbatore – 641 047 ABSTRACT In this paper, we introduced parallel communicating flip pushdown automata communicating by stacks. PCFPA (2) equals the family of recursively enumerable languages Also we have proved that. RPCFPA (3) equals the family of recursively enumerable languages. Key words: Pushdown automata, Flip pushdown automata, finite automata 1. INTRODUCTION A pushdown automaton is one way finite automaton with a separate pushdown store, that is first in first – out storage structure, which is manipulating by pushing and popping. Probably, such machines are best known for capturing the family of context free languages, which was independently established by Chomsky (Cole 1971). Pushdown automata have been extended in various ways. The extension of pushdown automata is recently introduced, is called flip pushdown automata (Border et al 1982). A is an ordinary pushdown with the additional ability to flip its pushdown push down during the computation. This allows the machine to push and pop at both ends of the pushdown, therefore, a flip-pushdown is a form of a 34
2.
International Journal of
Computer Engineering and Technology (IJCET), ISSN 0976 – 6367(Print), ISSN 0976 – 6375(Online) Volume 1, Number 1, May - June (2010), © IAEME dequeue storage structure and it becomes an equally power to Turing machines. A dequeue automaton com simulate two pushdowns. DEFINITION 1.1: PARALLEL COMMUNICATING FLIP PUSHDOWN AUTOMATA Parallel communicating flip pushdown automata system is of degree n is a construct A = (V, Γ , A1, A2,…..,An,K) where V is the input alphabet, Γ is the alphabet of pushdown symbols, for each 1 ≤ i ≤ n, Ai = (Qi , V , Γ , fi, ∆ i,qi, Zi, Fi ) where Qi is a finite set of states, Γ i is a finite pushdown alphabet , fi is a transition mapping from V∪ {ε } × Γ i to finite subsets of Qi × Γ i* is called transition function , ∆ i is a mapping from Qi to 2Qi, qi ∈ Qi , Zi ∈ Γ i , Fi ⊆ Qi be the set of final states and K ⊆ {K1, K2,……, Kn } ⊆ Γ is the set of query symbols. The Flip Pushdown automata A1, A2,…..,An are components of the system A. If there exists only one component, Ai, 1 ≤ i ≤ n, such that (r, α) ∈ fi (q, a, A) with α ∈ Γ *, |α|K > 0, for some r, q ∈ Qi, a ∈ V ∪ {∈}, A ∈ Γ , then the system is said to be centralized and Ai is said to be the master of the system. For the sake of simplicity, whenever a system is centralized its master is the first component. A parallel communicating flip pushdown automata system is schematically represented in Figure 1.1. As one can see in Figure 1.1, all stacks are connected with each other, each stack can send its contents to any other stack or receive the contents of any other stack. In the centralized case all stacks send their contents to a distinguished stack. In the case of the non-returning strategy, every stack preserves its contents after sending a copy of it to another component while in the case of the returning strategy the stack returns to its initial contents after communication. 35
3.
International Journal of
Computer Engineering and Technology (IJCET), ISSN 0976 – 6367(Print), ISSN 0976 – 6375(Online) Volume 1, Number 1, May - June (2010), © IAEME Figure 1.1 parallel communicating flips pushdown automata system The configuration or instantaneous of a parallel communicating flip pushdown automata system is defined as a 3n-tuple (s1, x1, α1, s2, x2, α2… sn, xn, αn) Where for 1 ≤ i ≤ n, si ∈ Qi is the current state of the component Ai, xi ∈ V* is the remaining part of the input word which has not yet been read by Ai, αi ∈ Γ * is the contents of the ith stack, the rightmost symbol being the topmost symbol on the pushdown store If a is in V ∪ {∈}, xi ∈ V* , αi , βi ∈ Γ * and Zi is in Γ , Then ( si , a xi , αi Zi) ├( pi , xi , αi βi ), if the pair (pi , βi ) is in fi (si , a xi , αi ), for the ordinary pushdown transitions and ( si , a xi , αi Zi) ├ (pi , xi , Zi αRi ), if pi is in ∆ i ( si ), for the flip pushdown transition or a pushdown reversal transitions. Whenever, there is a choice between an ordinary pushdown transition or a pushdown reversal of any i, then the pushdown automaton non-deterministically chooses the next move. We do not 36
4.
International Journal of
Computer Engineering and Technology (IJCET), ISSN 0976 – 6367(Print), ISSN 0976 – 6375(Online) Volume 1, Number 1, May - June (2010), © IAEME want the flip pushdown automaton to move the bottom of pushdown symbol when the pushdown is flipped. We define two variants of transition relations on the set of configurations of A in the following way: 1. (s1, x1, B1α1, ..... s2, xn, Bnαn ) ├ ( p1, y1, β1, …, pn, yn, βn) Where Bi ∈ Γ , αi, βi ∈ Γ *, 1 ≤ i ≤ n, iff one of the following two conditions holds: (i) K ∩ {B1, B2, …, Bn} = φ and xi = aiyi, ai ∈ V ∪ {ε}. {pi, β’i) ∈ fi(si, ai, Bi). βi = β’iαi, 1 ≤ i ≤ n, (ii) for all i, 1 ≤ i n such that Bi = Kji and Bji ε Ki βi = Bj αji αi, for all other r, 1 ≤ r ≤ n, βr = Brαr, and yt = xt, pt = st, for all t, 1 ≤ t ≤ n. 2. (s1, x1, B1 α1, …., sn, xn, Bn αn) ├ r (p1, y1, β1, ... pn, yn, βn) Where Bi ∈ Γ , αi, βi ∈ Γ *, 1 ≤ i ≤ n, iff one of the following two conditions holds: (i) K ∩ {B1, B2, …, Bn} = φ and xi = aiyi, ai ∈ V ∪ {ε}, {pi, β’i) ∈ fi(si, ai, Bi). βi = β’iαi, 1 ≤ i ≤ n, (ii) for all 1 ≤ i ≤ n such that Bi = Kj,, and Bji ∉ K, for all other r, 1 ≤ r ≤ n, βr = Brαr, and yt = xt, pt = st, for all t, 1 ≤ t ≤ n. The two transition relations defined above differ when the topmost symbols of some stacks are execute a communication step replacing each query symbol with the requested stack contents of the corresponding component. If the topmost symbol of the queried stack is also a query symbol, then first this query symbol must be replaced with the contents of the corresponding stack. The top of each communicated stack must be a non-query symbol before its contents can be sent to another component. If this condition cannot be fulfilled, (a circular query appeared), then the work of the automation system is blocked. After communication, the stack contents of the sending components remain the same in the case of relation, whereas it becomes the initial pushdown memory symbol 37
5.
International Journal of
Computer Engineering and Technology (IJCET), ISSN 0976 – 6367(Print), ISSN 0976 – 6375(Online) Volume 1, Number 1, May - June (2010), © IAEME in the case of relation. A parallel communicating flip pushdown automata system whose computations are based on relation is said to be non-returning; if its computations are based on relation, it is said to be returning. The language accepted by a parallel communicating flip automata system A as above is defined as Rec(A) = {x ∈ V* | (q1, x, Z1, …, qn, x, Zn) ├* (s1, ε, α1, …, sn, ε, α1, …, sn, ε, αn), with exactly n pushdown reversals , for any αi∈ Γ * and any si ∈ Fi, 1 ≤ i ≤ n}, Recr(A) = {x ∈ V* | (q1, x, Z1, …, qn, x, Zn) ├ *r (s1, ε, α1, …, sn, ε, α1, …, sn, ε, αn), with exactly n pushdown reversals , for any αi∈ Γ * and any si ∈ Fi, 1 ≤ i ≤ n}, where ├* and ├ *r , denote the reflexive and transitive closure of ├ and ├ r respectively. In the following we use the notations rcpcpfa (n) - for returning centralized parallel communicating flip pushdown automata systems of degree n, rpcfpa (n) - for returning parallel communicating flip pushdown automata systems of degree n, rpcfpa (n) - for centralized parallel communicating flip pushdown automata systems of degree n, pcfpa (n) - for parallel communicating flip pushdown automata systems of degree n. If x(n) is a type of automata system, then X(n) is the class of languages accepted by pushdown automata systems of type x(n). For example, RCPCFPA (n) is the class of languages accepted by automata of type rcpcfpa (n) (returning centralized parallel communicating flip pushdown automata systems of degree n). 38
6.
International Journal of
Computer Engineering and Technology (IJCET), ISSN 0976 – 6367(Print), ISSN 0976 – 6375(Online) Volume 1, Number 1, May - June (2010), © IAEME The following examples shows to help the better understanding of the notions defined above. EXAMPLE1.1 Let us consider the following rpfcpca (4) given by the transition mappings of its components. f1(q1, ε, Z1) = {(s1, a)}, f1(s1, ε, Z1) = {(p1, Z1)}, f1(p1, ε, Z1) = {(h1, Z1)}, f1(h1, ε, Z1) = {(r1, Z1), (t1, K3)}, f1(t1, ε, a) = {(s1, a)}, f3(q3, ε, Z3) = {(s3, K1)}, f3(s3, ε, a) = {(p3, K2 a)}, f3(p3, ε, a) = {(h3, a)}, f3(h3, ε, a) = {(q3, a)}, f3(h3, ε, Z3) = {(r3, Z3)}, f3(r3, a, Z3) = {(r3, Z3)}, f2(q2, ε, Z2) = {(s2, K1)}, f2(s2, ε, a) = {(p2, a)}, f2(p2, ε, Z2) = {(h2, Z2)}, f2(p2, ε, Z2) = {(h2, Z2)}, f2(r2, a, Z2) = {(r2, Z2)}, f f4(s4, ε, Z4) = {(h4, Z2)}, 4(q4, ε, Z4) = {(s4, Z4)}, f4(h4, ε, Z4) = {(t4, Z4)}, (v4, K3Z4)}, f4(t4, ε, Z4) = {(u4, Z4)}, f4(v4, ε, a) = {(s4, Z4)}, f4(v4, ε, a) = {(p4, a}, f4(p4, a, a = {(p4, ε)}, f4(p4, ε, Z4) = {(r4, Z4)} 39
7.
International Journal of
Computer Engineering and Technology (IJCET), ISSN 0976 – 6367(Print), ISSN 0976 – 6375(Online) Volume 1, Number 1, May - June (2010), © IAEME The final states are F1 = {r1}, F2 = {r2}, F3 = {r3}, F4 = {r4}. EXAMPLE1.2 A more intricate way of computation can be observed in the following cpcfpa (2). f1(q1, X, Z1) = {(q1, Z1)} f1(s1, ε, Z2) = {(p1, ε)} f1(p1, X, X) = {(p2, ε)} f1(p2, ε, X) = {(p2, ε)} f1(p2, ε, Z2) = {(p1, ε)} f1(p1, ε, Z1) = {(p1, Z1)} f2(q2, X, Z2) = {(q2, X, Z2)} f1(q1, c, Z1) = {(s1, K2 Z1)} f2(s2, X, Y) = {(q2, XY)} f1(s1, ε, X) = {(s1, K2 X)} f2(q2, c, X) = {(s2, X)} f2(s2, ε, X) = {(s2, ε} f2(s2, ε, Z2) = {(sf, Z2)} f2(sf, ε, Z2) = {(sf, Z2)} f2(sf, X, Z2) = {(sf, Z2)} where X, Y ε {a, b}, and the sets of final states are F1 = {pf}, F2 = {sf}. LEMMA1.1 1. RCPCFPA(n) ⊆ RPCFPA(n) and CPCFPA (n) ⊆ PCFPA(n) for all n ≥ 1. 2. X(1) equals the family of context-free languages and X(n) ⊆ X(n+1) for X ∈ {RCPCFPA, RPCFPA, CPCFPA, PCFPA}, n ≥ 1. 2 COMPUTATIONAL POWER We start by showing how non-returning parallel communicating pushdown automata systems can be simulated with returning systems. 40
8.
International Journal of
Computer Engineering and Technology (IJCET), ISSN 0976 – 6367(Print), ISSN 0976 – 6375(Online) Volume 1, Number 1, May - June (2010), © IAEME THEOREM 2.1 PCFPA(n) ⊆ RPCFPA (2n) for all n ≥ 2. PROOF Let A = (a, ∆, A1, A2, ..., An, K) be a pcpa(n) with Ai = (Qi, V, ∆, fi, qi, Zi, Fi), 1 ≤ i ≤ n. We construct the rpcpa (2n) A’ = (V, Γ ’, A’1, A1 , A’2, A 2 , …, A’n, A n , K’), Where K’ = {K , K , K , ..., K } ∪ K , K , K , ..., Kn}, and ' 1 ' 2 ' 3 ' n 1 2 3 for all 1 ≤ i ≤ n, A’1 = (Qi ∪ {q’| q ∈ Qi}, V, Γ ∪ { K i }, f’i, qi, Zi, Fi}, with (1) f’i (q, a, A) = {(r’, x) | (r, x) ∈ fi(q, a, A)} (2) f’i (q’, ε, Zi) = {(q, K i )}, where q, r ∈ Qi, a ∈ V ∪ {ε}, A ∈ Γ , and A i = ({ qi }, V, Γ ∪ {Zi, K’1}, f i , qi , Zi { qi }}, with (3) f i ( qi , a, Zi } = {( q i , K’1)}, (4) f i ( qi , ε, A} = {( q i , A)}, where a ∈ V ∪ {ε}, A ∈ Γ As one can easily see, every component of A has a “satellite” component in A’. Each accepting step in A is simulated by two accepting and two communication steps in A’ in the following way: In the first accepting step A’i and A i use the rules (1) and (3), respectively. Now the stacks of all components A’i have the same contents as the corresponding ones in A. Moreover, the current states of A’i are copies of the current states of the corresponding ones in A. 41
9.
International Journal of
Computer Engineering and Technology (IJCET), ISSN 0976 – 6367(Print), ISSN 0976 – 6375(Online) Volume 1, Number 1, May - June (2010), © IAEME THEOREM 2.2 PCFPA (2) equals the family of recursively enumerable languages. PROOF Let A = (Q, V, Γ , f, q, B1, B2, F) be a two-stack flip pushdown automaton. We construct the pcfpa(2) A = (V, Γ ’, A1, A2, {K1, K2}) with Γ ’ = Γ ∪ {Zi, [q, a, X, Y, α, β]i |q, α, β) ∈ f(r, a, X, Y), q, r, ∈ Q, a ∈ V ∪ {ε}, X, Y ∈ Γ , 1 ≤ i ≤ 2}, and Ai = {Qi, V, Γ ’, A1, A2, {K1, K2}) with Γ ’ = Γ ∪ {Zi, [q, a, X, Y, α, β]i | (q, α, β) ∈ f(r, a, X, Y), q, r, ∈ Q, a ∈ V ∪{ε}, X, Y ∈ Γ , 1 ≤ i ≤ 2}, and Ai = {Qi, V, Γ ’, fi, qi, Zi, F’), 1 ≤ i ≤ 2. where Qi = {qch, qrec, qw, [q, α], [q, β] | (q, α, β) ∈ f(r, a, X, Y), q, r, ∈ Q, a ∈ V ∪{ε}, X, Y ∈ Γ } ∪ {〈q, X〉 | q ∈ Q, X ∈ Γ } ∪ {q1, q2}, and F’ = {qch, qrec | q ∈ F}. and the transition mappings are defined as follows: (1) f1(q1, ∈, Z1) = {(qch, B1 Z1)}, f1(q2, ∈, Z2) = {(qrec, B2 Z2)}, This is the initial step in which both components change their states and stack contents in order to begin the simulation. (2) f1(qch, a, X) = {〈〈qch, [r, a, X, Y, α, β] 1) | r, α, β) ∈ f(q, a, X, Y),, Y ∈ Γ }, f2(qrec, ∈, X)= {〈〈q, X〉, K1)}, f1(qrec, ε, X = {〈〈q, X〉, K2〉}, f2(qch, a, Y = {〈〈qch, [r, a, X, Y, α, β]2 | (r, α, β) ∈ f(q, a, X, Y), X ∈ ∆}, where a ∈ V ∪ {ε}, X ∈ Γ . 42
10.
International Journal of
Computer Engineering and Technology (IJCET), ISSN 0976 – 6367(Print), ISSN 0976 – 6375(Online) Volume 1, Number 1, May - June (2010), © IAEME The first automaton, being in a state qch, q ∈ Q, reading a ∈ V ∪ {ε} on its input tape and X from its memory, chooses a possible move of the two-stack flip pushdown automaton in the same state, reading the same input symbol and reading X from its first stack. This move is encoded in a flip pushdown memory symbol and stored in the memory of the first component. The other component, being in state qrec, q ∈ Q requests the memory contents of the first component without moving its reading head. With the second group of transitions of (2) the same process can be done, but with A2, choosing a possible transition of A to be simulated. In simulation of A1 and A2 take turns in choosing the transitions. (3) f1 (qch, ε, [r, α, X, Y, α, β]1) = {(rw, α)}, f1(qw, ε, X) = {(qw, X), (qrec, X)}, f2 (q, Y), α, [r, α, X, Y, α, β]1) = {([r, β], ε)}, f2(|q, α], ε, X) = {([q, α], ε)}, f2(|q, α], ε, Z1) = {([qch, α)}, f2 (qch, ε, [r, α, X, Y, α, β]2) = {(rw, β)}, f2(qw, ε, X) = {(qw, X), (qrec, X)}, f1 (〈q, X〉, α, [r, α, X, Y, α, β]2) = {([r, β], ε)}, f1(|q, α], ε, X) = {([q, α], ε)}, f1(|q, α], ε, Z2) = {(qch, α)} Where q ∈ Q and α ∈ V ∪ {ε}. as the non-returning variants. THEOREM 2.3 RPCFPA (3) equals the family of recursively enumerable languages. PROOF We first show that for every two-stack flip pushdown automaton. Construct an rpcfpa system with three components such that the two devices accept the same language. Let A = (Q, V, Γ , f, qo, Z1 Z0, F) be a two-stack flip pushdown automaton. 0, 2 43
11.
International Journal of
Computer Engineering and Technology (IJCET), ISSN 0976 – 6367(Print), ISSN 0976 – 6375(Online) Volume 1, Number 1, May - June (2010), © IAEME Let us associate to any transition (r, α, β) ∈ f(q, a, A, B), where q, r ∈ Q, a ∈ V ∪ {∈}, A, B ∈ Γ , α, β, ∈ Γ * a new symbol [q, a, A, B, r, α, β] and let us denote the set of these symbols by ∆t. Moreover, let Q’ = {q’ q ∈ Q} and Qc = {〈q, x, X〉 | q ∈ Q, x ∈ V ∪ {ε}, X ∈ Γ }. The simulating rpcfpa A is constructed as follows: A = (V, Γ , A, A1, A2, A3, {K1}), Where A = {Z1, Z2, Z3,} ∪ Γ ∪ Γ t, and A1 = (Q ∪ Q’, V, Γ A, f1, q0, Z1, F) A2 = (Q ∪ Qc, V, Γ A, f2, q0, Z1 , F) 0 2 A3 = (Q ∪ Qc, V, Γ A, f3, q0, Z0 , F). We define the transition mappings of the components as follows: (1) f1(q, a, Z1) = {(r’, [q, a, A, B, r, α, β]) | [q, a, A, B, r, α, β] ∈ Γ t}, f2(q, a, A) = {(〈q, a, A〉, K1)}, f3(q, a, B) = {(〈q, a, B〉, K1)}, where q ∈ Q, a ∈ V ∪ {ε}, A, B ∈ Γ , (2) f1(r’, ε, Z1)= (r, Z1), f2(〈q, a, A), ε, [q, a, A, B, r, α, β]) = (r, α), f3(〈q, a, B), ε, [q, a, A, B, r, α, β]) = (r, β), where r’ ∈ Q’, [q, a, A, B, r, α, β] ∈ Γ t. 3. CONCLUSION We define a property called communication parallel communicating flip pushdown automata. Flip pushdown automata are pushdown with the additional ability to flip or reverse its pushdown. We have proved that RPCFPA equals the family of recursively enumerable languages. 44
12.
International Journal of
Computer Engineering and Technology (IJCET), ISSN 0976 – 6367(Print), ISSN 0976 – 6375(Online) Volume 1, Number 1, May - June (2010), © IAEME REFERERENCES: 1. Martin-Vide, C., Mateescu, A. and Mitrana, V. (2002), Parallel finite automata Systems communicating by states, International Journal of the Foundations of Computing Science 13 (5),pp. 733-749. 2. A.O.Budo , “ Multiprocessor automata ” ,Infor.Process.Lett.25(1977) 257-261. 3. Elena Czeizler and Eugen Czeizler (2006), ‘Parallel Communicating Watson- Crick Automat Systems, Acta Cybernetica 17 ,685-700. 4. Csuhaj – Varju, E. and Dassow, J. (1990), On cooperating / distributed grammar systerms, Journal of Information processing and Cybernetics 26, 49-63. 5. Markus Holzer(2003), ‘Flip pushdown automata: Nondeterminism is better than Determinism, FIG Research Report. 45
Baixar agora