On the Complexity of L-reachability

DOI10.1007/978-3-319-09704-6_23zbMath1416.68084arXiv1701.03255OpenAlexW251428722MaRDI QIDQ5496194

Balagopal Komarath, M. N. Jayalal Sarma, K. S. Sunil

Publication date: 7 August 2014

Published in: Descriptional Complexity of Formal Systems (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1701.03255

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Related Items (1)

Rational index of languages with bounded dimension of parse trees

This page was built for publication: On the Complexity of L-reachability