Filters








6,652 Hits in 2.6 sec

Checking automata and one-way stack languages

Sheila Greibach
1969 Journal of computer and system sciences (Print)  
A checking automaton is equivalent to a one-way nonerasing stack automaton which, once it enters its stack, never again writes on its stack.  ...  Thus the quasi-real-time one-way stack languages are not a full AFL but are a proper subAFL of the one-way stack languages.  ...  In section five we examine quasi-real-time stack automata. l. CHECKING AUTOMATA LANGUAGES In section one we define checking automaton languages and establish some of their properties.  ... 
doi:10.1016/s0022-0000(69)80012-7 fatcat:dpt6zhxoincbln5xjhob2szfla

The power of two-way deterministic checking stack automata

Joost Engelfriet
1989 Information and Computation  
It is well known that nondeterministic two-way checking stack automata recognize NSPACE(n).  ...  We show that deterministic two-way checking stack automata have the same power as deterministic two-way two-head finite automata.  ...  Two-way nondeterministic checking stack automata (with one head) recognize NSPACE(n) (Fischer, 1969; Ibarra, 1971) .  ... 
doi:10.1016/0890-5401(89)90015-1 fatcat:g2xzyan2efam5iprqecbys3suy

Page 1895 of Mathematical Reviews Vol. 57, Issue 5 [page]

1979 Mathematical Reviews  
Recall that a checking stack is a stack for which writing on the top 8 initially permitted, but once the stack is entered in read-only mode, the stack can never be written on again (and so serves as a  ...  A height-in- creasing move simultaneously pushes a symbol on the pushdown store and moves the checking stack pointer up one square.  ... 

Space Complexity of Stack Automata Models [chapter]

Oscar H. Ibarra, Jozef Jirásek, Ian McQuillan, Luca Prigioniero
2020 Lecture Notes in Computer Science  
This paper examines several measures of space complexity on variants of stack automata: non-erasing stack automata and checking stack automata.  ...  We give a detailed characterization of the accept and strong space complexity measures for checking stack automata.  ...  We study the above complexity measures for machines and languages of oneway stack automata, non-erasing stack automata, and checking stack automata.  ... 
doi:10.1007/978-3-030-48516-0_11 fatcat:dbeisheizvfmpgdvsrymfbvg5m

On Infinite Words Determined by Stack Automata

Tim Smith, Marc Herbstritt
2013 Foundations of Software Technology and Theoretical Computer Science  
We extend this result to the class of languages recognized by one-way nondeterministic checking stack automata (1-NCSA).  ...  We characterize the infinite words determined by one-way stack automata. An infinite language L determines an infinite word α if every string in L is a prefix of α.  ...  I want to thank my advisor, Rajmohan Rajaraman, for supporting this work, encouraging me, and offering many helpful comments and suggestions.  ... 
doi:10.4230/lipics.fsttcs.2013.413 dblp:conf/fsttcs/Smith13 fatcat:x2mlmmzyaneuvf36ef3hoodwhu

An Infinite Automaton Characterization of Double Exponential Time [chapter]

Salvatore La Torre, P. Madhusudan, Gennaro Parlato
2008 Lecture Notes in Computer Science  
(NLINSPACE) languages.  ...  The salient aspect of this characterization is that the automata have no ostensible limits on time nor space, and neither direction of containment with respect to 2ETIME is obvious.  ...  way as finite-state automata would.  ... 
doi:10.1007/978-3-540-87531-4_5 fatcat:mvw4xtq7zvf6hlxryqdclul73m

Page 2148 of Mathematical Reviews Vol. , Issue 86e [page]

1986 Mathematical Reviews  
This is in constrast to a result which shows that 2-way nondeterministic checking stack automata are equivalent to nondeterministic linear bounded automata.  ...  Author summary: “The classes of languages accepted by alternat- ing pushdown automata, alternating stack automata, and alternat- ing nonerasing stack automata, both with and without an auxiliary space-bounded  ... 

Stack languages and log n space

K.N. King, C. Wrathall
1978 Journal of computer and system sciences (Print)  
Here we refine this result in the following way: if L is a language accepted by a one-way nondeterministic stack automaton then there is a language L' and a nonerasing homomorphism h such that L = h(L'  ...  It is known that the class of languages accepted by one-way nondeterministic stack automata is included in the class of languages accepted by deterministic Turing machines that use only linear space [8  ...  Let 1NCSA (1DCSA) denote the class of languages accepted by one-way nondeterministic (deterministic) checking stack automata.  ... 
doi:10.1016/0022-0000(78)90010-7 fatcat:ab2aaf6rbbc55d4bywmf76jgpu

Variations of checking stack automata: Obtaining unexpected decidability properties

Oscar H. Ibarra, Ian McQuillan
2018 Theoretical Computer Science  
We introduce a model of one-way language acceptors (a variant of a checking stack automaton) and show the following decidability properties: (1) The deterministic version has a decidable membership problem  ...  We also investigate decidability properties of other variations of checking stack automata (e.g., allowing multiple stacks, two-way input, etc.).  ...  The class of one-way deterministic (resp. nondeterministic) checking stack automata is denoted by DCSA (resp., NCSA) [2] .  ... 
doi:10.1016/j.tcs.2018.04.024 fatcat:6fuizbibybfkvlxoub3hbbzqim

Two-way automata with more than one storage medium

Jörg Vogel, Klaus Wagner
1985 Theoretical Computer Science  
Two-way automata with a stack (a nonerasing stack or a pushdown store, respectively) and an arbitrary number of checking stacks are of special interest.  ...  This paper is concerned with the computational power of two-way automata with more than one subrecursive storage medium.  ...  Acknowledgment We would like to thank Jill Be~v~i~, Michal Chytil and the unknown referee for a lot of valuable hints which have helped us to make the paper much more comprehensible.  ... 
doi:10.1016/0304-3975(85)90142-2 fatcat:lmb6c63azjeh7jiy26pkxanvme

The Power of Writing, a Pebble Hierarchy and a Narrative for the Teaching of Automata Theory

Carolina Mejía, J. Andres Montoya, Christian Nolasco
2018 Electronical Notes in Theoretical Computer Science  
The hierarchy begins at the level of finite state automata (0-pebble automata) and approaches the model of onetape Turing machines.  ...  Thus, it can be argued that it is a complete hierarchy that covers, in a continuous way, all the models of automata that are important in the theory of computation.  ...  The first author would like to thank COLCIENCIAS for the grant confered, and which allows her to develop her ph.D studies.  ... 
doi:10.1016/j.entcs.2018.06.007 fatcat:xqyxo6gzereo5imw5ohmvxs2da

Iterated stack automata and complexity classes

Joost Engelfriet
1991 Information and Computation  
k + 1 )-iterated pushdown automata are more powerful than one-way k-iterated pushdown automata for every k 3 1 (and similarly for iterated stack, checking stack, etc., automata).  ...  It is shown in (Vogel and Wagner, 1985) that DTIME(exp,(poly)) is the class of languages accepted by deterministic multi-head automata with one pushdown and k (independent) checking stacks.  ... 
doi:10.1016/0890-5401(91)90015-t fatcat:o5cnyhrwz5eerkvulkrkjuw5sa

Variations of Checking Stack Automata: Obtaining Unexpected Decidability Properties [chapter]

Oscar H. Ibarra, Ian McQuillan
2017 Lecture Notes in Computer Science  
We introduce a model of one-way language acceptors (a variant of a checking stack automaton) and show the following decidability properties: 1.  ...  We also investigate decidability properties of other variations of checking stack automata (e.g., allowing multiple stacks, two-way input, etc.).  ...  We let ⊢ * M The class of one-way deterministic (resp. nondeterministic) checking stack automata is denoted by DCSA (resp., NCSA) [2] .  ... 
doi:10.1007/978-3-319-62809-7_17 fatcat:xcuacfupi5h7tmla4jlhqhoozm

Properties of probabilistic pushdown automata

Ioan I. Macarie, Mitsunori Ogihara
1998 Theoretical Computer Science  
the number of stack symbols; that is, whether the stack alphabet contains one versus two distinct symbols. @ 1998-Elsevier Science E3.V.  ...  Properties of' (unbounded-error) probabilistic as well as "probabilistic plus nondeterministic" pushdown automata and auxiliary pushdown automata are studied.  ...  Acknowledgements The first author is grateful to Eric Allender for enjoyable discussions on this topic.  ... 
doi:10.1016/s0304-3975(98)00059-0 fatcat:wblsfvu4urfxhj4p2vz3pjopiy

Remarks on multihead pushdown automata and multihead stack automata

Satoru Miyano
1983 Journal of computer and system sciences (Print)  
ACKNOWLEDGMENTS The author is grateful to Setsuo Arikawa and Takeshi Hayashi for many inspiring conversations about hardest languages and to an anonymous referee for his suggestions on the proof of Theorem  ...  This result is espcially interesting because of the relationship between one-way automata and two-way automata.  ...  and stack automata.  ... 
doi:10.1016/0022-0000(83)90032-6 fatcat:c7w5x2kvmfd3dc2dqcg3qepa7u
« Previous Showing results 1 — 15 out of 6,652 results