Visibly rational expressions
From MaRDI portal
Publication:2453980
DOI10.1007/s00236-013-0190-6zbMath1354.68148OpenAlexW2003723473MaRDI QIDQ2453980
Publication date: 12 June 2014
Published in: Acta Informatica (Search for Journal in Brave)
Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2012/3860/
Formal languages and automata (68Q45) Algebraic theory of languages and automata (68Q70) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (5)
Nested Regular Expressions Can Be Compiled to Small Deterministic Nested Word Automata ⋮ Parameterized linear temporal logics meet costs: still not costlier than LTL ⋮ Visibly linear temporal logic ⋮ Temporal logics with language parameters ⋮ Visibly linear dynamic logic
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Query Automata for Nested Words
- Adding nesting structure to words
- Marrying Words and Trees
- Regular Linear Temporal Logic
- Alternating Automata and a Temporal Fixpoint Calculus for Visibly Pushdown Languages
- Visibly pushdown languages
- Visibly Pushdown Kleene Algebra and Its Use in Interprocedural Analysis of (Mutually) Recursive Programs
- Alternation
- Tools and Algorithms for the Construction and Analysis of Systems
- Regular Languages of Nested Words: Fixed Points, Automata, and Synchronization
- Visibly Pushdown Transducers for Approximate Validation of Streaming XML
- FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science
- Programming Techniques: Regular expression search algorithm
- Automata, Languages and Programming
- Reachability analysis of pushdown automata: Application to model-checking
This page was built for publication: Visibly rational expressions
