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
DETERMINISTIC PUSHDOWN AUTOMATA AND UNARY LANGUAGES
On a subclass of context-free groups
Title not available (Why is that?)
On the separability of sparse context-free languages and of bounded rational relations
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
Title not available (Why is that?)
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
Title not available (Why is that?)
More concise representation of regular languages by automata and regular expressions
On jump-deterministic pushdown automata
Investigations on automata and languages over a unary alphabet
Decision problems among the main subfamilies of rational relations
A graph-based regularity test for deterministic context-free languages
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
Title not available (Why is that?)
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
Title not available (Why is that?)
On equivalence and subclass containment problems for deterministic context-free languages
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)