Filters








386 Hits in 2.3 sec

Writing pushdown acceptors

George Mager
1969 Journal of computer and system sciences (Print)  
This paper introduces a new automaton, called a writing pushdown acceptor (abbreviated wpda), and investigates some of its properties.  ...  A wpda is essentially a two-way pushdown acceptor that can write on its input tape. A number of results about wpda are established.  ...  Specifically, a new acceptor, called a "writing pushdown acceptor" (wpda), is introduced and studied.  ... 
doi:10.1016/s0022-0000(69)80017-6 fatcat:hysqjdzfpjdoxhu2dt3xenpfqe

Reachability Analysis for Some Models of Infinite-State Transition Systems [chapter]

Oscar H. Ibarra, Tevfik Bultan, Jianwen Su
2000 Lecture Notes in Computer Science  
We extend a CM by augmenting it with some familiar data structures: (i) A pushdown counter machine (PCM) is a CM augmented with an unrestricted pushdown stack.  ...  (ii) A tape counter machine (TCM) is a CM augmented with a two-way read/write worktape that is restricted in that the number of times the head crosses the boundary between any two adjacent cells of the  ...  configuration α satisfying: # a (α w ) = # b (α w ), M can only reach a configuration β satisfying: The reason is that set of α's and β's satisying the the stated properties can be accepted by deterministic CM acceptors  ... 
doi:10.1007/3-540-44618-4_15 fatcat:fyws5qzlkrbqreoekyxxjj3qxu

ON REACHABILITY AND SAFETY IN INFINITE-STATE SYSTEMS

OSCAR H. IBARRA, TEVFIK BULTAN, JIANWEN SU
2001 International Journal of Foundations of Computer Science  
We extend a CM by augmenting it with some familiar data structures: (i) A pushdown counter machine (PCM) is a CM augmented with an unrestricted pushdown stack.  ...  (ii) A tape counter machine (TCM) is a CM augmented with a two-way read/write worktape that is restricted in that the number of times the head crosses the boundary between any two adjacent cells of the  ...  Restrict the worktape to be a pushdown stack which can only push (i.e., write) but cannot pop (i.e., erase), but can enter the stack in a read-only mode.  ... 
doi:10.1142/s0129054101000898 fatcat:tmbvqwt7qzduziftsnqlnbxnzu

Context-Free Grammars with Storage [article]

Joost Engelfriet
2014 arXiv   pre-print
Context-free S grammars are equivalent to pushdown S automata.  ...  ( a ); call B ; write ( b ); call C ; call D end or begin write ( b ) end where “write(a)” means “write a on the output tape”.  ...  The RT(Tree-pushdown) r-acceptor is the top-down tree-pushdown tree automaton (called pushdown tree automaton in [Gue2]). Although Tree-pushdown has no identity, it can easily be simulated.  ... 
arXiv:1408.0683v1 fatcat:sr2by746tvfenjsotqqop67v2a

Reversal-bounded multipushdown machines

Brenda S. Baker, Ronald V. Book
1974 Journal of computer and system sciences (Print)  
The second states that every r.e. set is accepted by an on-line Turing acceptor with two pushdown stores such that in every computation, each pushdown store can make at most one reversal (that is, one  ...  It is shown that this automata theoretic representation cannot be strengthened by restricting the acceptors to be deterministic multitape, nondeterministic one-tape, or nondeterministic multicounter acceptors  ...  (say, a deterministic Turing acceptor with just one one-way infinite tape and just one read-write head) by an on-line acceptor with two pushdown stores as auxiliary storage. 2 This language theoretic  ... 
doi:10.1016/s0022-0000(74)80027-9 fatcat:4xbxafatyngnrlj63adkarkqpm

On Removing the Pushdown Stack in Reachability Constructions [chapter]

Oscar H. Ibarra, Zhe Dang
2001 Lecture Notes in Computer Science  
It has been shown recently that the binary reachability of a discrete pushdown timed automaton can be accepted by a 2-tape pushdown acceptor with reversal-bounded counters.  ...  A discrete pushdown timed automaton is a pushdown machine with integer-valued clocks.  ...  PM: Pushdown machine 2. PA: Pushdown acceptor 3. PCM: Pushdown machine with reversal-bounded counters 4. PCA: Pushdown acceptor with reversal-bounded counters 5. FM: Finite-state machine 6.  ... 
doi:10.1007/3-540-45678-3_22 fatcat:pleb3eqv5bhwzlwe7mdm2lo5x4

Eliminating the storage tape in reachability constructions

Oscar H. Ibarra, Zhe Dang
2003 Theoretical Computer Science  
It has been shown recently that the binary reachability of a discrete pushdown timed automaton can be accepted by a two-tape pushdown acceptor with reversal-bounded counters.  ...  A discrete pushdown timed automaton is a pushdown machine with integer-valued clocks.  ...  All models are nondeterministic. (1) PM: Pushdown machine. (2) PA: Pushdown acceptor.  ... 
doi:10.1016/s0304-3975(02)00545-5 fatcat:fymfxwgclbh33pxrz2t7eobiqy

Page 951 of Mathematical Reviews Vol. 55, Issue 3 [page]

1978 Mathematical Reviews  
The analogue of (2) is that any language accepted in linear time by a reversal bounded multitape Turing acceptor can be accepted in real time by a nondeterministic acceptor with three pushdown stores,  ...  multitape Turing acceptor can be accepted in real time by a nondeterministic acceptor with three pushdown stores and hence can be expressed as the length-preserving homomorphic image of the intersection  ... 

On store languages of language acceptors

Oscar H. Ibarra, Ian McQuillan
2018 Theoretical Computer Science  
Here many models of language acceptors with various data structures are examined, along with a study of their store languages.  ...  It is well known that the "store language" of every pushdown automaton -- the set of store configurations (state and stack contents) that can appear as an intermediate step in accepting computations --  ...  In this paper, the store languages of several models of language acceptors are studied.  ... 
doi:10.1016/j.tcs.2018.05.036 fatcat:hnzdk34anjdr3jzlbpv7het3xy

Generalizing the Discrete Timed Automaton [chapter]

Oscar H. Ibarra, Jianwen Su
2001 Lecture Notes in Computer Science  
Extend a PCA acceptor by allowing the machine to have multiple pushdown stacks.  ...  For example, if D is a pushdown stack, then loc is the top of the stack; if D is a two-way read-write tape, then loc is the symbol under the read-write head; if D is a queue, then loc is the symbol in  ... 
doi:10.1007/3-540-44674-5_13 fatcat:nucxl4epofhlplcmoiisj7wsde

Page 1379 of Mathematical Reviews Vol. 52, Issue 4 [page]

1976 Mathematical Reviews  
Deterministic writing stack acceptors (dwsa), nonerasing writing stack acceptors (newsa), and nonerasing deterministic writing stack acceptors (nedwsa) are similarly defined from the corresponding two-way  ...  A writing stack acceptor (wsa) is a two-way nondeterministic Stack acceptor that is allowed to print (write) on its two-way input tape.  ... 

Augmenting the discrete timed automaton with other data structures

Oscar H. Ibarra, Jianwen Su
2002 Theoretical Computer Science  
., a pushdown stack, a queue, a read-write worktape, etc.). Let A be a discrete timed automaton and M be a machine in C.  ...  Extend a PCA acceptor by allowing the machine to have multiple pushdown stacks.  ...  For example, if D is a pushdown stack, then loc is the top of the stack; if D is a two-way read-write tape, then loc is the symbol under the read-write head; if D is a queue, then loc is the symbol in  ... 
doi:10.1016/s0304-3975(01)00269-9 fatcat:bgf6wtcybvcqlppu5dpb6x7ks4

Pushdown cellular automata

Martin Kutrib
1999 Theoretical Computer Science  
A stack augmented generalization of cellular automata, the pushdown cellular automata, are investigated. We are studying the language accepting capabilities of such devices.  ...  We study linear arrays of deterministic pushdown automata. Accordingly, our models are called pushdown cellular automata (PDCA) resp. iterative pushdown arrays (IPDA).  ...  After finishing the simulation of the first acceptor the result is stored in a special register. Subsequently, the second acceptor is simulated.  ... 
doi:10.1016/s0304-3975(97)00187-4 fatcat:bob5gxtz65hdxiqn6zzq4x6vai

Pushdown Compression

Pilar Albert, Elvira Mayordomo, Philip Moser, Sylvain Perifel, Marc Herbstritt
2008 Symposium on Theoretical Aspects of Computer Science  
We prove that Lempel-Ziv is incomparable with pushdown compressors.  ...  We compare the performance of the Lempel-Ziv algorithm with that of the pushdown compressors, or compression algorithms that can be implemented with a pushdown transducer.  ...  We write |w| for the length of a string w in Σ * . The empty string is denoted by λ.  ... 
doi:10.4230/lipics.stacs.2008.1332 dblp:conf/stacs/AlbertMMP08 fatcat:ipybgu6r5nbatjnbwrhbodb7pa

Linearity is polynomially decidable for realtime pushdown store automata

S.A. Greibach
1979 Information and Control  
Hence "L(M) ~ L" is decidable for M a realtime deterministic pushdown store acceptor and L the language accepted by final state by a single turn deterministic pushdown store acceptor.  ...  If M is a realtime deterministic pushdown store acceptor and L(M) is linear context-free, we can construct a realtime single turn deterministic pushdown store automaton _~r with L(M) = L(~I).  ...  If c 1 ---~ c 2 and c 2 --->~ c 3 , we write q --+~ c~ and let c --+~ c trivially for any configuration c.  ... 
doi:10.1016/s0019-9958(79)90134-7 fatcat:p6k4foitfvfmpa47aighxiuacy
« Previous Showing results 1 — 15 out of 386 results