Regularity and Related Problems for Deterministic Pushdown Automata

Cited in

(34)

Deciding semantic finiteness of pushdown processes and first-order grammars w.r.t. bisimulation equivalence
Definability Results for Top-Down Tree Transducers
On a subclass of context-free groups
DETERMINISTIC PUSHDOWN AUTOMATA AND UNARY LANGUAGES
On the separability of sparse context-free languages and of bounded rational relations
scientific article; zbMATH DE number 7453188 (Why is no real title available?)
Deterministic Pushdown Automata and Unary Languages
Set automata
On the sizes of DPDAs, PDAs, LBAs
A hierarchy of deterministic languages
Descriptional complexity of two-way pushdown automata with restricted head reversals
Descriptional complexity of two-way pushdown automata with restricted head reversals
scientific article; zbMATH DE number 7566065 (Why is no real title available?)
More Concise Representation of Regular Languages by Automata and Regular Expressions
Descriptional complexity of bounded regular languages
Simplification problems for deterministic pushdown automata on infinite words
More concise representation of regular languages by automata and regular expressions
scientific article; zbMATH DE number 3677223 (Why is no real title available?)
On jump-deterministic pushdown automata
Investigations on automata and languages over a unary alphabet
A graph-based regularity test for deterministic context-free languages
Decision problems among the main subfamilies of rational relations
On reducing the number of stack symbols in a PDA
Ramsey quantifiers over automatic structures: complexity and applications to verification
On the descriptional complexity of the window size for deleting restarting automata
New families of non real time dpda's and their decidability results
Generalized parenthesis languages and minimization of their parenthesis parts
Rational subsets of partially reversible monoids
scientific article; zbMATH DE number 7559498 (Why is no real title available?)
Some results on subclass containment problems for special classes of dpda's related to nonsingular machines
On the Descriptional Complexity of the Window Size for Deterministic Restarting Automata
On equivalence and subclass containment problems for deterministic context-free languages
scientific article; zbMATH DE number 7561596 (Why is no real title available?)
Simple context-free languages and free monadic recursion schemes

This page was built for publication: Regularity and Related Problems for Deterministic Pushdown Automata

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4045649)