Nodes connected by path languages

DOI10.1007/978-3-642-22321-1_24MaRDI QIDQ5199972zbMATH OpenOpenAlexFDO

Authors Markus Holzer, Martin Kutrib, Ursula Leiter

Publication date 29 July 2011

Published in Developments in Language Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-22321-1_24

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• On the complexity of L-reachability
• On the complexity of L-reachability
• Formal language constrained path problems
• Formal language constrained reachability and model checking propositional dynamic logics
• Space complexity of reachability testing in labelled graphs

Cited in

(5)

• Rational index of languages with bounded dimension of parse trees
• Formal language constrained reachability and model checking propositional dynamic logics
• On the complexity of L-reachability
• On the complexity of L-reachability
• Rational index of languages defined by grammars with bounded dimension of parse trees

This page was built for publication: Nodes connected by path languages

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