FST TCS '01 Proceedings of the 21st Conference on Foundations of Software Technology and Theoretical Computer Science
Efficient Algorithms for Model Checking Pushdown Systems
CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Regularity problems for visibly pushdown languages
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
Congruences for visibly pushdown languages
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Visibly pushdown automata: from language equivalence to simulation and bisimulation
CSL'06 Proceedings of the 20th international conference on Computer Science Logic
Third-order idealized algol with iteration is decidable
FOSSACS'05 Proceedings of the 8th international conference on Foundations of Software Science and Computation Structures
FSTTCS'04 Proceedings of the 24th international conference on Foundations of Software Technology and Theoretical Computer Science
Synchronization of pushdown automata
DLT'06 Proceedings of the 10th international conference on Developments in Language Theory
CSR'08 Proceedings of the 3rd international conference on Computer science: theory and applications
On the complexity of membership and counting in height-deterministic pushdown automata
CSR'08 Proceedings of the 3rd international conference on Computer science: theory and applications
On the complexity of membership and counting in height-deterministic pushdown automata
Journal of Automata, Languages and Combinatorics
Precedence automata and languages
CSR'11 Proceedings of the 6th international conference on Computer science: theory and applications
Tree template matching in ranked ordered trees by pushdown automata
CIAA'11 Proceedings of the 16th international conference on Implementation and application of automata
Language equivalence of deterministic real-time one-counter automata is NL-complete
MFCS'11 Proceedings of the 36th international conference on Mathematical foundations of computer science
Arbology: trees and pushdown automata
LATA'10 Proceedings of the 4th international conference on Language and Automata Theory and Applications
Operator precedence and the visibly pushdown property
LATA'10 Proceedings of the 4th international conference on Language and Automata Theory and Applications
Test generation from recursive tiles systems
TAP'12 Proceedings of the 6th international conference on Tests and Proofs
Operator precedence and the visibly pushdown property
Journal of Computer and System Sciences
An intersection type system for deterministic pushdown automata
TCS'12 Proceedings of the 7th IFIP TC 1/WG 202 international conference on Theoretical Computer Science
Tree template matching in ranked ordered trees by pushdown automata
Journal of Discrete Algorithms
| Hi-index | 0.00 |
We define the notion of height-deterministic pushdown automata, a model where for any given input string the stack heights during any (nondeterministic) computation on the input are a priori fixed. Different subclasses of height-deterministic pushdown automata, strictly containing the class of regular languages and still closed under boolean language operations, are considered. Several such language classes have been described in the literature. Here, we suggest a natural and intuitive model that subsumes all the formalisms proposed so far by employing height-deterministic pushdown automata. Decidability and complexity questions are also considered.