Regularity and Related Problems for Deterministic Pushdown Automata

Cited in

(35)

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

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)