On the efficient construction of quasi-reversible automata for reversible languages (Q963387): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.ipl.2007.12.004
+Normal rank
@@ Property / OpenAlex ID @@
+W2160728288
@@ Property / OpenAlex ID: W2160728288 / rank @@
+Normal rank
@@ Property / Wikidata QID @@
+Q58209344
@@ Property / Wikidata QID: Q58209344 / rank @@
+Normal rank
@@ Property / cites work @@
+Inference of Reversible Languages
@@ Property / cites work: Inference of Reversible Languages / rank @@
+Normal rank
@@ Property / cites work @@
+An algorithm for strongly connected component analysis in \(n \log n\) symbolic steps
+Normal rank
@@ Property / cites work @@
+Q4799353
@@ Property / cites work: Q4799353 / rank @@
+Normal rank
@@ Property / cites work @@
+Q2754000
@@ Property / cites work: Q2754000 / rank @@
+Normal rank
@@ Property / cites work @@
+Learning regular languages using RFSAs.
@@ Property / cites work: Learning regular languages using RFSAs. / rank @@
+Normal rank
@@ Property / cites work @@
+A Lower Bound For Reversible Automata
@@ Property / cites work: A Lower Bound For Reversible Automata / rank @@
+Normal rank
@@ Property / cites work @@
+Q4737155
@@ Property / cites work: Q4737155 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3044317
@@ Property / cites work: Q3044317 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3763607
@@ Property / cites work: Q3763607 / rank @@
+Normal rank