The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.

## Filters

##
###
Page 6994 of Mathematical Reviews Vol. , Issue 96k
[page]

1996
*
Mathematical Reviews
*

Therefore we obtain that the class

*of*languages ac- cepted*by*the one-way (*linear*) stack automata is*a*proper subset*of*the class*of*languages*accepted**by*the one-way*tree*-stack automata and that two-way ... As*a*special case*of**tree*-stack automata we consider*tree*-*pushdown*automata. ...##
###
Deterministic tree pushdown automata and monadic tree rewriting systems

1988
*
Journal of computer and system sciences (Print)
*

Also we show that finite unions

doi:10.1016/0022-0000(88)90014-1
fatcat:t5rzzr2h4jevxlajob2mygkk5i
*of*congruence classes*of*canonical monadic*tree*rewriting systems can be recognized*by**deterministic**tree**pushdown*automata without the additional*acceptance*conditions ... We show that the*deterministic**tree**pushdown*automata*of*J. H. Gallier and R. V. Book (Theoret. Comput. Sci. 37 (1985) 123-150) are strictly more powerful than the corresponding automata*of*K. M. ... increases the*recognition*power*of*the*tree**pushdown*automata. ...##
###
Linear-Time Recognizable Classes of Tree Languages by Deterministic Linear Pushdown Tree Automata

2009
*
IEICE transactions on information and systems
*

Since

doi:10.1587/transinf.e92.d.248
fatcat:rybwz3a2mrednat3yze4574ghu
*recognition**of*an input*tree**by**a**deterministic*L-PDTA can be done in*linear*time,*deterministic*L-PDTAs are applicable to many kinds*of*applications. ...*A*strict hierarchy will be shown among the classes*of**tree*languages defined*by**a*variety*of**deterministic*L-PDTAs. ... Since*recognition**of*an input*tree**by**a**deterministic*L-PDTA can be done in*linear*time,*deterministic*L-PDTAs are also useful for many kinds*of*applications. ...##
###
Page 764 of Mathematical Reviews Vol. , Issue 80B
[page]

1980
*
Mathematical Reviews
*

The equivalence problem for nonsingular

*deterministic**pushdown*automata is reduced to the problem*of*deciding whether*a**deterministic**pushdown*av. tomaton is nonsingular. ... Warwick, Coventry, 1973],*a**deterministic**pushdown**automaton*is said to be “nonsingular” if there is*a*nonnegative integer k, so that*of*two accessible configurations with the stack*of*one as the prefix ...##
###
Fast nondeterministic recognition of context-free languages using two queues

1998
*
Information Processing Letters
*

We show how to

doi:10.1016/s0020-0190(98)00091-x
fatcat:3iyjo7eyozfj7mgtjk5yj4cwmy
*accept**a*context-free language nondeterministically in O( n log n) time on*a*two-queue machine. ... If we restrict to real or*linear*time, the class*of*languages*accepted**by*queue machines is incomparable with that*of**pushdown*1 automata, even in the nondeterministic case and with multiple queues. ...*A*Turing machine running in time T can be straightforwardly simulated*by**a*queue*automaton*in time T 2 . For*a**deterministic*, one-queue*automaton*, Li and Vitányi [7] show that this is optimal. ...##
###
Page 2570 of Mathematical Reviews Vol. , Issue 98D
[page]

1998
*
Mathematical Reviews
*

The present paper characterizes the domains

*of*the corresponding*tree*transforma- tions using*a*new naturally defined*tree*recognizer and shows that the ranges*of*(super)*linear**deterministic**tree*transformations ... The model*of*superlinear*deterministic*top-down*tree*transducers was first considered*by*Z. Fiilép and H. Vogler. ...##
###
Deterministic left to right parsing of Tree Adjoining Languages

1990
*
Proceedings of the 28th annual meeting on Association for Computational Linguistics -
*

Each parser consists

doi:10.3115/981823.981858
dblp:conf/acl/SchabesV90
fatcat:7msmjw7ayzdmnkh4og6j7bifxa
*of**a*finite state control that drives the moves*of**a*Bottom-up Embedded*Pushdown**Automaton*. The parsers handle*deterministically*some context-sensitive*Tree*Adjoining Languages. ... We define*a*set*of**deterministic*bottom-up left to right parsers which analyze*a*subset*of**Tree*Adjoining Languages. ... We focus our attention on showing how*a*bottomup embedded*pushdown**automaton*is*deterministically*driven given*a*parsing table. ...##
###
Page 4217 of Mathematical Reviews Vol. , Issue 99f
[page]

1999
*
Mathematical Reviews
*

*A*one-turn

*pushdown*

*automaton*with Bichi

*acceptance*is

*a*

*pushdown*

*automaton*M = (K,z,I,6,qo,Zo,F), where the set

*of*states K = K, + K2 is partitioned into K, and K2, and the transition relation 6 C K, ... In this paper, PIC(Z”) is characterized

*by*one-turn push-down automata with Biichi

*acceptance*and 2-

*linear*w-grammars. ...

##
###
Page 260 of Mathematical Reviews Vol. , Issue 85a
[page]

1985
*
Mathematical Reviews
*

On the other hand, there is no such algorithm if L is

*accepted**by**a*1-turn*deterministic**pushdown**automaton*or*by*an unrestricted*deterministic*counter*automaton*. ... Authors’ summary: “It is proved that the set*of*all languages*accepted*within*a*fixed, language-dependent number*of*steps*by**deterministic*one-dimensional cellular acceptors is*a*proper subset*of*the set ...##
###
Simulation of Two-Way Pushdown Automata Revisited

2013
*
Electronic Proceedings in Theoretical Computer Science
*

The

doi:10.4204/eptcs.129.15
fatcat:mtosvaxch5c3jbhzzzltqvb5qe
*linear*-time simulation*of*2-way*deterministic**pushdown*automata (2DPDA)*by*the Cook and Jones constructions is revisited. ... The simulation is then extended to 2-way nondeterministic*pushdown*automata (2NPDA) to provide for*a*cubic-time*recognition**of*context-free languages. ... Jones for pointing the author to Cook's construction, and to Akihiko Takano for providing the author with excellent working conditions at the National Institute*of*Informatics, Tokyo. ...##
###
Ties between Parametrically Polymorphic Type Systems and Finite Control Automata
[article]

2020
*
arXiv
*
pre-print

We present

arXiv:2009.04437v3
fatcat:543tqv4aunbnlctk6mjh2c65ga
*a*correspondence and bisimulation between variants*of*parametrically polymorphic type systems and variants*of*finite control automata, such as FSA, PDA,*tree*automata and Turing machine. ... problems, and present potential software engineering applications, other than fluent API generation, which may benefit from judicious use*of*type theory. ... ,*deterministic*, shallow,*linear*⟩ DCFL 4*Tree**Automaton*TA ⟨*tree*-store, stateless, real-time, shallow,*linear*⟩ DCFL*PushDown**Automaton*PDA non-*deterministic*-DPDA= ⟨*pushdown*, stateful, -transitions ...##
###
Page 1997 of Mathematical Reviews Vol. , Issue 84e
[page]

1984
*
Mathematical Reviews
*

The second is that

*a*special form*of**automaton*, called*a*‘*deterministic**linear*bounded*tree**automaton*, is sufficient to recognize this new class*of**tree*adjunct grammars.” ... Upton, Richard*A*. An extension*of**tree*adjunct grammars. ...##
###
An innovative finite state concept for recognition and parsing of context-free languages

1996
*
Natural Language Engineering
*

We show that all languages which are in the regular closure

doi:10.1017/s1351324997001666
fatcat:d46bzgl3ync55ptgnfl4kc4jfq
*of*the class*of**deterministic*(contextfree) languages can be recognized in*linear*time. ... This is*a*nontrivial result, since this closure contains many inherently ambiguous languages. ... Acknowledgements The first author has had fruitful discussions with Joop Leo about*linear*-time recognizability*of*subclasses*of*context-free languages. ...##
###
Alternating multihead finite automata

1988
*
Theoretical Computer Science
*

We conclude

doi:10.1016/0304-3975(88)90122-3
fatcat:4mp5g6fievaw3obaqk3yoekjue
*by*placing upper bounds on the*deterministic*time and space complexity*of*the classes*of*languages*accepted**by*alternating multihead finite automata. ... We study the relationships between the classes*of*languages*accepted**by*alternating multihead finite automata and the dasses*accepted**by**deterministic*and nondeterministic multihead finite automata and ... An*accepting*computation*tree**of*M on input x is*a**tree*T whose nodes are labelled*by*configurations*of*M on input x such that (i) the root*of*T is labelled*by*the initial configuation*of*M, (ii) if C ...##
###
Model Checking Linear Properties of Prefix-Recognizable Systems
[chapter]

2002
*
Lecture Notes in Computer Science
*

This enables us to reduce the membership problem (whether an

doi:10.1007/3-540-45657-0_31
fatcat:b72iabdq3nc6jdg2tjxffglacy
*automaton**accepts*the*tree*obtained*by*unwinding*a*given finite labeled graph)*of*two-way nondeterministic path automata to the emptiness problem ... Indeed, the fact that*a**tree**automaton*can split to copies and simultaneously read all the paths*of*the*tree*has*a*computational price and is irrelevant for*linear*properties. ... The size*of*the regular*tree*is*linear*in the size*of*the alphabet*of*the*pushdown*system and the size*of*the 2ABT is*linear*in the size*of*the CTL formula. ...
« Previous

*Showing results 1 — 15 out of 288 results*