Definability by weakly deterministic regular expressions with counters is decidable

From MaRDI portal


DOI10.1007/978-3-662-48057-1_29MaRDI QIDQ2946353zbMATH OpenOpenAlexFDO

Authors Markus Latte, Matthias Niewerth

Publication date 16 September 2015

Published in Mathematical Foundations of Computer Science 2015 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-662-48057-1_29


Mathematics Subject Classification ID

Formal languages and automata (68Q45) Analysis of algorithms and problem complexity (68Q25)




Recommendations


Cites work


Cited in
(9)








This page was built for publication: Definability by weakly deterministic regular expressions with counters is decidable

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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Definability_by_weakly_deterministic_regular_expressions_with_counters_is_decidable&oldid=85389767"
Powered by MediaWiki