A regularity test for pushdown machines

Cited in

(44)

Some results on subclass containment problems for special classes of dpda's related to nonsingular machines
On solving star equations
A hierarchy of deterministic languages
A representation of trees by languages. II
A graph-based regularity test for deterministic context-free languages
A lower bound for the nondeterministic space complexity of context-free recognition
On LR(k) grammars and languages
Economy of description by parsers, DPDA's, and PDA's
A representation of trees by languages. I
-computations on deterministic pushdown machines
Lower bounds on space complexity for contextfree recognition
On equivalence and subclass containment problems for deterministic context-free languages
Set of memories of a D-graph
Theory of formal grammars
On the degrees of non-regularity and non-context-freeness
Deciding semantic finiteness of pushdown processes and first-order grammars w.r.t. bisimulation equivalence
LR-regular grammars - an extension of LR(k) grammars
Simplification problems for deterministic pushdown automata on infinite words
Set automata
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
Deterministic Pushdown Automata and Unary Languages
scientific article; zbMATH DE number 3677223 (Why is no real title available?)
Equivalent transformations of metalinear LA(1) grammars and unary recursive schemes
Sur une propriété d'itération des langages algébriques déterministes
scientific article; zbMATH DE number 3776892 (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
scientific article; zbMATH DE number 7453188 (Why is no real title available?)
Monadic decomposability of regular relations
Self-verifying pushdown and queue automata
Streamability of nested word transductions
On the descriptional complexity of the window size for deleting restarting automata
THE PHENOMENON OF NON-RECURSIVE TRADE-OFFS
Pushdown automata and constant height: decidability and bounds
Complexity of multi-head finite automata: origins and directions
Descriptional complexity of finite automata -- selected highlights
Ramsey quantifiers over automatic structures: complexity and applications to verification
New families of non real time dpda's and their decidability results
On the separability of sparse context-free languages and of bounded rational relations

This page was built for publication: A regularity test for pushdown machines

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