Visibly rational expressions

DOI10.1007/S00236-013-0190-6MaRDI QIDQ2453980zbMATH OpenOpenAlexFDO

Authors Laura Bozzelli, César Sánchez

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/

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Formal languages and automata (68Q45) Algebraic theory of languages and automata (68Q70)

Recommendations

• Visibly rational expressions
• Visibly pushdown languages
• A Grammatical Representation of Visibly Pushdown Languages
• Automata, Languages and Programming
• Regularity Problems for Visibly Pushdown Languages

Cites work

• Adding nesting structure to words
• Alternating Automata and a Temporal Fixpoint Calculus for Visibly Pushdown Languages
• Alternation
• Automata, Languages and Programming
• FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science
• scientific article; zbMATH DE number 1670555 (Why is no real title available?)
• scientific article; zbMATH DE number 3664335 (Why is no real title available?)
• Marrying Words and Trees
• Programming Techniques: Regular expression search algorithm
• Query Automata for Nested Words
• Reachability analysis of pushdown automata: Application to model-checking
• Regular Languages of Nested Words: Fixed Points, Automata, and Synchronization
• Regular Linear Temporal Logic
• Tools and Algorithms for the Construction and Analysis of Systems
• Visibly pushdown Kleene algebra and its use in interprocedural analysis of (mutually) recursive programs
• Visibly pushdown languages
• Visibly Pushdown Transducers for Approximate Validation of Streaming XML

Cited in

(6)

• Visibly linear dynamic logic
• Parameterized linear temporal logics meet costs: still not costlier than LTL
• Visibly rational expressions
• Nested Regular Expressions Can Be Compiled to Small Deterministic Nested Word Automata
• Temporal logics with language parameters
• Visibly linear temporal logic

Describes a project that uses

Uses Software

• SPIN
• Bebop

This page was built for publication: Visibly rational expressions

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