Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
Bebop: A Symbolic Model Checker for Boolean Programs
Proceedings of the 7th International SPIN Workshop on SPIN Model Checking and Software Verification
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Analysis of recursive state machines
ACM Transactions on Programming Languages and Systems (TOPLAS)
Third-order idealized algol with iteration is decidable
FOSSACS'05 Proceedings of the 8th international conference on Foundations of Software Science and Computation Structures
The benefits of exposing calls and returns
CONCUR 2005 - Concurrency Theory
Visibly pushdown automata for streaming XML
Proceedings of the 16th international conference on World Wide Web
Proceedings of the twenty-sixth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
The word problem for visibly pushdown languages described by grammars
Formal Methods in System Design
Model Checking: From Tools to Theory
25 Years of Model Checking
Weighted Logics for Nested Words and Algebraic Formal Power Series
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II
Adding nesting structure to words
Journal of the ACM (JACM)
State Complexity of Nested Word Automata
LATA '09 Proceedings of the 3rd International Conference on Language and Automata Theory and Applications
Nondeterministic state complexity of nested word automata
Theoretical Computer Science
Operational state complexity of nested word automata
Theoretical Computer Science
Visibly pushdown transducers for approximate validation of streaming XML
FoIKS'08 Proceedings of the 5th international conference on Foundations of information and knowledge systems
Limitations of lower bound methods for deterministic nested word automata
Information and Computation
Normalization of sequential top-down tree-to-word transducers
LATA'11 Proceedings of the 5th international conference on Language and automata theory and applications
Descriptional complexity of unambiguous nested word automata
LATA'11 Proceedings of the 5th international conference on Language and automata theory and applications
State complexity of operations on input-driven pushdown automata
MFCS'11 Proceedings of the 36th international conference on Mathematical foundations of computer science
Regularity problems for visibly pushdown languages
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
Visibly pushdown automata: from language equivalence to simulation and bisimulation
CSL'06 Proceedings of the 20th international conference on Computer Science Logic
Minimization, learning, and conformance testing of boolean programs
CONCUR'06 Proceedings of the 17th international conference on Concurrency Theory
On the membership problem for visibly pushdown languages
ATVA'06 Proceedings of the 4th international conference on Automated Technology for Verification and Analysis
Adding nesting structure to words
DLT'06 Proceedings of the 10th international conference on Developments in Language Theory
Secure programming via visibly pushdown safety games
CAV'12 Proceedings of the 24th international conference on Computer Aided Verification
DLT'12 Proceedings of the 16th international conference on Developments in Language Theory
Height-deterministic pushdown automata
MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
Minimizing variants of visibly pushdown automata
MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
Trimming visibly pushdown automata
CIAA'13 Proceedings of the 18th international conference on Implementation and Application of Automata
Hi-index | 0.00 |
We study congruences on words in order to characterize the class of visibly pushdown languages (Vpl), a subclass of context-free languages. For any language L, we define a natural congruence on words that resembles the syntactic congruence for regular languages, such that this congruence is of finite index if, and only if, L is a Vpl. We then study the problem of finding canonical minimal deterministic automata for Vpls. Though Vpls in general do not have unique minimal automata, we consider a subclass of VPAs called k-module single-entry VPAs that correspond to programs with recursive procedures without input parameters, and show that the class of well-matched Vpls do indeed have unique minimal k-module single-entry automata. We also give a polynomial time algorithm that minimizes such k-module single-entry VPAs.