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

## Filters

##
###
Page 5646 of Mathematical Reviews Vol. , Issue 2004g
[page]

2004
*
Mathematical Reviews
*

*finite*

*automata*

*with*

*recursive*

*calls*

*and*

*DPDAs*. ... Summary: “We study

*deterministic*

*finite*

*automata*(DFA)

*with*

*recursive*

*calls*, that is,

*finite*sequences of component DFAs that can

*call*each other

*recursively*. ...

##
###
Page 2672 of Mathematical Reviews Vol. , Issue 82f
[page]

1982
*
Mathematical Reviews
*

Author’s summary: “In this paper, we introduce a new normal form
for

*deterministic*pushdown*automata*(*DPDA*), the ‘atomic normal form’. ... Gorn, we give alternate*and*more direct proofs of results of B. Courcelle [same journal 6 (1978), no. 3, 255-279; ibid. 7 (1978), no. 1, 25-55; MR 58 #13955ab] relating*recursion*schemes*and**DPDA*. ...##
###
Equivalence problems for deterministic context-free languages and monadic recursion schemes

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

The equivalence problem for

doi:10.1016/s0022-0000(77)80019-6
fatcat:q4i2opin55gcdgjf6kuh5khn3m
*deterministic*context-free languages is shown to be decidable if arid only if the strong equivalence problem for monadic*recursion*schemes is decidable. ... A monadic*recursion*scheme has a vocabulary consisting of a*finite*set of function symbols ,~-, a*finite*set of predicate symbols ~,*and*a*finite*set of function variable symbols ~g"(*with*designated initial ... Combining these translatability results*with*those of Section 3 give us the main result of the paper: The equivalence problem for*deterministic*pushdown*automata*is decidable if*and*only if the strong ...##
###
Decision Problems for Deterministic Pushdown Automata on Infinite Words

2014
*
Electronic Proceedings in Theoretical Computer Science
*

We summarize some recent results on the decidability of the regularity

doi:10.4204/eptcs.151.4
fatcat:gxxf7gxwmnhnfmgvsjiskdoj3y
*and*the equivalence problem for the class of weak omega-*DPDAs*. ... For the specification of a parity condition, the states of the omega-*DPDA*are assigned priorities (natural numbers),*and*a run is accepting if the highest priority that appears infinitely often during ... These sets of configurations are sets of words over Γ, starting*with*a symbol from Q,*and*can be represented by*finite**automata*. ...##
###
Edit Distance for Pushdown Automata
[chapter]

2015
*
Lecture Notes in Computer Science
*

standard model for programs

doi:10.1007/978-3-662-47666-6_10
fatcat:4hl6famudncfxoahuijmgsy75i
*with**recursion*) to a regular language (the specification). ... We study the edit distance computation problem between pushdown*automata**and*their subclasses. ...*Finite**automata*. A non-*deterministic**finite*automaton (NFA) is a pushdown automaton*with*empty stack alphabet. ...##
###
Pushdown automata with bounded nondeterminism and bounded ambiguity

1997
*
Theoretical Computer Science
*

Measures for the amount of ambiguity

doi:10.1016/s0304-3975(96)00267-8
fatcat:wf24l4uwmfalnabhnoczhfzp4u
*and*nondeterminism in pushdown*automata*( ... The class of languages accepted by PDAs*and**DPDAs*is*called*the class of context-free languages (CFL)*and**deterministic*context-free languages (DCFL), respectively. Definition 2. ... There is an unambiguous*DPDA*for every B,i*with*a size*recursive*in the size of M. ...##
###
Pushdown automata with bounded nondeterminism and bounded ambiguity
[chapter]

1995
*
Lecture Notes in Computer Science
*

Measures for the amount of ambiguity

doi:10.1007/3-540-59175-3_102
fatcat:ttyfkvrodfal7icohb2rhl333a
*and*nondeterminism in pushdown*automata*( ... The class of languages accepted by PDAs*and**DPDAs*is*called*the class of context-free languages (CFL)*and**deterministic*context-free languages (DCFL), respectively. Definition 2. ... There is an unambiguous*DPDA*for every B,i*with*a size*recursive*in the size of M. ...##
###
On the succinctness of different representations of languages
[chapter]

1979
*
Lecture Notes in Computer Science
*

The purposes of this paper is to give simple new proofs of some interesting recent results about the relative succinctness of different representations of regular,

doi:10.1007/3-540-09510-1_22
fatcat:daekpe2ctje2hpudxl2bfrboeu
*deterministic**and*unambiguous context-free ... languages*and*to derive some new results about how the relative succinctness of representations change when the representations contain a formal proof that the languages generated are in the desired subclass ... (a) There is no*recursive*succinctness bound for the representation of*finite*sets by*finite**automata**and*by Tm's*with*proofs that they accept*finite*sets. ...##
###
Decidable subcases of the equivalence problem for recursive program schemes

1987
*
RAIRO - Theoretical Informatics and Applications
*

*Deterministic*Pushdown

*Automata*A

*deterministic*pushdown automaton, for short a

*DPDA*, is a 6-tuple where K is a

*finite*set of states, X is a

*finite*alphabet, q 0 e K is a designated state

*called*the initial ...

*with*the équivalence problem for

*deterministic*pushdown

*automata*. ...

##
###
On the Succinctness of Different Representations of Languages

1980
*
SIAM journal on computing (Print)
*

The purposes of this paper is to give simple new proofs of some interesting recent results about the relative succinctness of different representations of regular,

doi:10.1137/0209010
fatcat:cq4fshk27jayjhsvrpdlcl5by4
*deterministic**and*unambiguous context-free ... languages*and*to derive some new results about how the relative succinctness of representations change when the representations contain a formal proof that the languages generated are in the desired subclass ... (a) There is no*recursive*succinctness bound for the representation of*finite*sets by*finite**automata**and*by Tm's*with*proofs that they accept*finite*sets. ...##
###
Regularity Problems for Weak Pushdown ω-Automata and Games
[chapter]

2012
*
Lecture Notes in Computer Science
*

We show that the regularity

doi:10.1007/978-3-642-32589-2_66
fatcat:vgv56zhgpzdkridklhexppowg4
*and*equivalence problems are decidable for*deterministic*weak pushdown ω-*automata*, giving a partial answer to a question raised by Cohen*and*Gold in 1978. ... We prove the decidability by a reduction to the corresponding problems for*deterministic*pushdown*automata*on*finite*words. ...*With*thanks to Wladimir Fridman for fruitful discussions. ...##
###
Page 1494 of Mathematical Reviews Vol. , Issue 81D
[page]

1981
*
Mathematical Reviews
*

Local mappings of one-dimensional tessellation

*automata**with*state alphabet A*and**with*a template of n elements (contiguous neighbourhood structure) are*called*scope-n iocal maps over A. ... Linna, Matti 81d:68070 Two decidability results of*deterministic*pushdown*automata*. J. Comput. System Sci. 18 (1979), no. 1, 92-107. ...##
###
Fling - A Fluent API Generator

2019
*
European Conference on Object-Oriented Programming
*

We present the first general

doi:10.4230/lipics.ecoop.2019.13
dblp:conf/ecoop/GilR19
fatcat:hj24istisvfbjhwsy6b62qi6c4
*and*practical solution of the fluent API problem -an algorithm, that given a*deterministic*language (equivalently, LR(k), k ≥ 0 language) encodes it in an unbounded parametric ... ACM Subject Classification Software*and*its engineering → General programming languages; Software*and*its engineering → Domain specific languages ... Pushdown*Automata*Intuitively, a pushdown automaton (PDA) is a*finite*state automaton (FSA) additionally equipped*with*a stack whose values are drawn from some*finite*set of stack symbols. ...##
###
New techniques for proving the decidability of equivalence problems

1990
*
Theoretical Computer Science
*

Devices like

doi:10.1016/0304-3975(90)90189-o
fatcat:di2t56ea5za35gtaitugmyooyi
*deterministic*pushdown*automata*(*DPDAs*) or ,nultitape*deterministic**finite**automata*(MDFAs) are difficult to test for equivalence sine=. ... Further, if there are*DPDAs*P = MO, Mt.. . . , M, = Q, such that Mi*and*M;+, are synchronized for i = 0,1, . . . , n -I, then we*call*P*and*Q synchronkable. ... Cl A common way to prove the decidability of the equivalence problem for devices like*deterministic*pushdown*automata*(*DPDAs*) or*deterministic*multitape*finite*acceptors (DMFAs) is to find a method how ...##
###
New techniques for proving the decidability of equivalence problems
[chapter]

1988
*
Lecture Notes in Computer Science
*

Devices like

doi:10.1007/3-540-19488-6_114
fatcat:qudpqphzdfgfvdkvf6hdjped2i
*deterministic*pushdown*automata*(*DPDAs*) or ,nultitape*deterministic**finite**automata*(MDFAs) are difficult to test for equivalence sine=. ... Further, if there are*DPDAs*P = MO, Mt.. . . , M, = Q, such that Mi*and*M;+, are synchronized for i = 0,1, . . . , n -I, then we*call*P*and*Q synchronkable. ... Cl A common way to prove the decidability of the equivalence problem for devices like*deterministic*pushdown*automata*(*DPDAs*) or*deterministic*multitape*finite*acceptors (DMFAs) is to find a method how ...
« Previous

*Showing results 1 — 15 out of 194 results*