Results 1  10
of
105
WORM2DPDAs: An extension to 2DPDAs that can be simulated in linear time
 Information Processing Letters 52
, 1994
"... We extend 2way deterministic pushdown automata (2DPDAs) with a writeoncereadmany (WORM) store. We show that it allows linear time simulation by a variant of Cook’s construction. As an example we develop a linear time algorithm that recognizes the language {V V −1WW−1  V,W ∈ (a  b)∗}, that b ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
We extend 2way deterministic pushdown automata (2DPDAs) with a writeoncereadmany (WORM) store. We show that it allows linear time simulation by a variant of Cook’s construction. As an example we develop a linear time algorithm that recognizes the language {V V −1WW−1  V,W ∈ (a  b
ECONQ~MY OF DESCRIPTION BY PARSERS, DPDA’S, AND PDA’S*
, 1976
"... Abstract. It 14 shown that there is a sequence of languages E,. E’;,... such that tx’t‘r) correct prefix 1 lrser (one which detects errors at the earliest possible momcn I, e.::.. LR or 1L parsers) for E, has six 2’“. yet a deterministic PDA rccogni/ing E, exists ir,sd has six O(n‘). Thcrc is anot ..."
Abstract
 Add to MetaCart
Abstract. It 14 shown that there is a sequence of languages E,. E’;,... such that tx’t‘r) correct prefix 1 lrser (one which detects errors at the earliest possible momcn I, e.::.. LR or 1L parsers) for E, has six 2’“. yet a deterministic PDA rccogni/ing E, exists ir,sd has six O(n‘). Thcrc
Deterministic Pushdown Automata and Unary Languages
, 2009
"... The simulation of deterministic pushdown automata defined over a oneletter alphabet by finite state automata is investigated from a descriptional complexity point of view. We show that each unary deterministic pushdown automaton of size s can be simulated by a deterministic finite automaton with a ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
The simulation of deterministic pushdown automata defined over a oneletter alphabet by finite state automata is investigated from a descriptional complexity point of view. We show that each unary deterministic pushdown automaton of size s can be simulated by a deterministic finite automaton with a
Creative Commons Attribution License. Decision Problems for Deterministic Pushdown Automata on Infinite Words
"... The article surveys some decidability results for DPDAs on infinite words (ωDPDA). We summarize some recent results on the decidability of the regularity and the equivalence problem for the class of weak ωDPDAs. Furthermore, we present some new results on the parity index problem for ωDPDAs. For ..."
Abstract
 Add to MetaCart
The article surveys some decidability results for DPDAs on infinite words (ωDPDA). We summarize some recent results on the decidability of the regularity and the equivalence problem for the class of weak ωDPDAs. Furthermore, we present some new results on the parity index problem for ωDPDAs
Contextfree Language Induction by Evolution of Deterministic Pushdown Automata Using Genetic Programming
 in Working Notes of the Genetic Programming Symposium, AAAI95, Eric Siegel and
, 1995
"... The process of learning often consists of Inductive Inference, making generalizations from samples. The problem here is finding generalizations (Grammars) for Formal Languages from finite sets of positive and negative sample sentences. The focus of this paper is on ContextFree Languages (CFL’s) as ..."
Abstract

Cited by 8 (0 self)
 Add to MetaCart
’s) as defined ContextFree Grammars (CFG’s), some of which are accepted by Deterministic PushDown Automata (DPDA). This paper describes a metalanguage for constructing DPDA’s. This language is then combined with Genetic Programming to evolve DPDA’s which accept languages. The technique is illustrated
Quantum automata and quantum grammars
 Theoretical Computer Science
"... Abstract. To study quantum computation, it might be helpful to generalize structures from language and automata theory to the quantum case. To that end, we propose quantum versions of finitestate and pushdown automata, and regular and contextfree grammars. We find analogs of several classical the ..."
Abstract

Cited by 52 (2 self)
 Add to MetaCart
Abstract. To study quantum computation, it might be helpful to generalize structures from language and automata theory to the quantum case. To that end, we propose quantum versions of finitestate and pushdown automata, and regular and contextfree grammars. We find analogs of several classical
Deciding DPDA Equivalence is Primitive Recursive
 IN PROCEEDINGS 29TH COLLOQIUM ON AUTOMATA, LANGUAGES AND PROGRAMMING, NUMBER 2380 IN LECTURE NOTES IN COMPUTER SCIENCE
, 2001
"... this paper I describe a simpler decision procedure that is determinisitic and that avoids the decomposition mechanism for termination (the rule CUT in [14] and the transformation TC in [12]). Instead, there is a new and simpler analysis of termination, centred on a new combinatorial result, "th ..."
Abstract

Cited by 33 (1 self)
 Add to MetaCart
;the extension theorem". One consequence is that the syntax of the starting process calculus is not extended. Another consequence is a primitive recursive upper bound on the complexity of the procedure. Section 2 introduces the DPDA problem as a bisimulation equivalence problem. Section 3 describes some
c © OttovonGuerickeUniversität Magdeburg TWOWAY FINITE AUTOMATA WITH A WRITEONCE TRACK
"... The basic finite automata model has been extended over the years with different acceptance modes (nondeterminism, alternation), new or improved devices (twoway heads, pebbles, nested pebbles) and with cooperation. None of these additions permits recognition of nonregular languages. The purpose o ..."
Abstract
 Add to MetaCart
of this work is to investigate a new kind of automata which is inspired by an extension of 2DPDAs. Mogensen enhanced these with what he called a WORM (write once, read many) track and showed that Cook’s lineartime simulation result still holds. Here we trade the pushdown store for nondeterminism or a pebble
A Note on Limited Pushdown Alphabets in Stateless Deterministic Pushdown Automata
, 2012
"... ar ..."
Results 1  10
of
105