On the Complexity of Language Membership for Probabilistic Words | Paper Citation Record

Observation 102b2ff1-4dcb-4d6c-82e3-3f704d677391 · outbound

This paper cites If the current clique algorithms are optimal, so is V aliant's parser.

On the Complexity of Language Membership for Probabilistic Words If the current clique algorithms are optimal, so is V aliant's parser

Reference 1

Resolution: unresolved; no resolver link, observed 2026-08-04T10:57:23.678326Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 73321dae-e494-4d56-903e-7a74cb280f2b · outbound

This paper cites A very hard log-space counting class.

On the Complexity of Language Membership for Probabilistic Words A very hard log-space counting class

Reference 2

Resolution: unresolved; no resolver link, observed 2026-08-04T10:57:23.749927Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation bd251001-0dbe-4d13-9a1e-56e67e9546ea · outbound

This paper cites Context-free grammars where every word has exactly two derivation trees.

On the Complexity of Language Membership for Probabilistic Words Context-free grammars where every word has exactly two derivation trees

Reference 3

Resolution: unresolved; no resolver link, observed 2026-08-04T10:57:23.835756Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation ef01f5c5-8e63-413d-bc35-786f6a32e0d4 · outbound

This paper cites Tractable circuits in database theory.

On the Complexity of Language Membership for Probabilistic Words Tractable circuits in database theory

Reference 4

Resolution: unresolved; no resolver link, observed 2026-08-04T10:57:23.974945Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 4482c865-2296-470e-8f6c-88b21e409ce7 · outbound

This paper cites Efficient Enumeration Algorithms for Annotated Grammars.

On the Complexity of Language Membership for Probabilistic Words Efficient Enumeration Algorithms for Annotated Grammars

Reference 5

Resolution: unresolved; no resolver link, observed 2026-08-04T10:57:24.087188Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation bbb0e49a-0a22-458f-a156-59052d57ca82 · outbound

This paper cites The Non-Cancelling Intersections Conjecture.

On the Complexity of Language Membership for Probabilistic Words The Non-Cancelling Intersections Conjecture

Reference 6

Resolution: unresolved; no resolver link, observed 2026-08-04T10:57:24.203090Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 29d6789b-3408-47fa-a715-1b47c881fa95 · outbound

This paper cites \# NFA admits an FPRAS : E fficient enumeration, counting, and uniform generation for logspace classes.

On the Complexity of Language Membership for Probabilistic Words \# NFA admits an FPRAS : E fficient enumeration, counting, and uniform generation for logspace classes

Reference 7

Resolution: unresolved; no resolver link, observed 2026-08-04T10:57:24.303300Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation a6d6b634-69a2-4dd2-8ae2-0a43b504e640 · outbound

This paper cites Baker and Ronald V.

On the Complexity of Language Membership for Probabilistic Words Baker and Ronald V

Reference 8

Resolution: unresolved; no resolver link, observed 2026-08-04T10:57:24.413207Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 8990cf20-837b-4d7f-876d-21852826678f · outbound

This paper cites Berstel and L.

On the Complexity of Language Membership for Probabilistic Words Berstel and L

Reference 9

Resolution: unresolved; no resolver link, observed 2026-08-04T10:57:24.492684Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 04364c66-3075-4c44-8731-2f9a057555ee · outbound

This paper cites Partial words and a theorem of F ine and W ilf.

On the Complexity of Language Membership for Probabilistic Words Partial words and a theorem of F ine and W ilf

Reference 10

Resolution: unresolved; no resolver link, observed 2026-08-04T10:57:24.554450Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 4d15d98b-a7dd-41c1-b08f-d3d2f67838a5 · outbound

This paper cites Ranking and formal power series.

On the Complexity of Language Membership for Probabilistic Words Ranking and formal power series

Reference 11

Resolution: unresolved; no resolver link, observed 2026-08-04T10:57:24.664829Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 276247f8-9ea7-4ffc-bc89-4f2f608d319a · outbound

This paper cites The complexity of computing the number of strings of given length in context-free languages.

On the Complexity of Language Membership for Probabilistic Words The complexity of computing the number of strings of given length in context-free languages

Reference 12

Resolution: unresolved; no resolver link, observed 2026-08-04T10:57:24.737833Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation dc680765-3aee-4223-9fa1-a58ddd6fbda5 · outbound

This paper cites Random generation for finitely ambiguous context-free languages.

On the Complexity of Language Membership for Probabilistic Words Random generation for finitely ambiguous context-free languages

Reference 13

Resolution: unresolved; no resolver link, observed 2026-08-04T10:57:24.853432Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 1b2bad43-9c2c-47a4-95d7-3f9565bf0a43 · outbound

This paper cites Counting distinct squares in partial words.

On the Complexity of Language Membership for Probabilistic Words Counting distinct squares in partial words

Reference 14

Resolution: unresolved; no resolver link, observed 2026-08-04T10:57:24.890756Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 3b81bd10-0543-44d8-80f2-e76620214681 · outbound

This paper cites Words with many palindrome pair factors.

On the Complexity of Language Membership for Probabilistic Words Words with many palindrome pair factors

Reference 15

Resolution: unresolved; no resolver link, observed 2026-08-04T10:57:24.966305Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 95fb52e3-945f-4493-b32f-f9e4960437ba · outbound

This paper cites On the palindromic complexity of infinite words.

On the Complexity of Language Membership for Probabilistic Words On the palindromic complexity of infinite words

Reference 16

Resolution: unresolved; no resolver link, observed 2026-08-04T10:57:25.045972Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation bb1f40e5-763e-4c3f-bc7f-fd90d84cad6b · outbound

This paper cites an unresolved cited work.

On the Complexity of Language Membership for Probabilistic Words Unresolved cited work

Reference 17

Resolution: unresolved; no resolver link, observed 2026-08-04T10:57:25.187265Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 57627dd7-4e1c-48af-9a23-95fd42677db1 · outbound

This paper cites P \'e rez, and Ritam Raha.

On the Complexity of Language Membership for Probabilistic Words P \'e rez, and Ritam Raha

Reference 18

Resolution: unresolved; no resolver link, observed 2026-08-04T10:57:25.291533Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 5996fad0-a4b6-488e-b5be-47a903bea3c4 · outbound

This paper cites On the Complexity of the Universality and Inclusion Problems for Unambiguous Context-Free Grammars.

On the Complexity of Language Membership for Probabilistic Words On the Complexity of the Universality and Inclusion Problems for Unambiguous Context-Free Grammars

Reference 19

Resolution: unresolved; no resolver link, observed 2026-08-04T10:57:25.336561Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation a84c4a7e-b167-47c1-8823-2f7fa01f65b1 · outbound

This paper cites Separability of reachability sets of vector addition systems.

On the Complexity of Language Membership for Probabilistic Words Separability of reachability sets of vector addition systems

Reference 20

Resolution: unresolved; no resolver link, observed 2026-08-04T10:57:25.356246Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 34b12622-680d-458c-8d9f-69aeb6d4b366 · outbound

This paper cites Unambiguity in automata theory.

On the Complexity of Language Membership for Probabilistic Words Unambiguity in automata theory

Reference 21

Resolution: unresolved; no resolver link, observed 2026-08-04T10:57:25.369334Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 585fdf26-24a0-4a21-ad42-d12a31e4e0fd · outbound

This paper cites Naive infinite enumeration of context-free languages in incremental polynomial time.

On the Complexity of Language Membership for Probabilistic Words Naive infinite enumeration of context-free languages in incremental polynomial time

Reference 22

Resolution: unresolved; no resolver link, observed 2026-08-04T10:57:25.491175Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 27fa56d9-b5a2-45de-b2f4-7d3d948bbf96 · outbound

This paper cites an unresolved cited work.

On the Complexity of Language Membership for Probabilistic Words Unresolved cited work

Reference 23

Resolution: unresolved; no resolver link, observed 2026-08-04T10:57:25.631290Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 0cac8ef9-073b-4bc9-984d-819b3c97ad90 · outbound

This paper cites An approach to regular separability in vector addition systems.

On the Complexity of Language Membership for Probabilistic Words An approach to regular separability in vector addition systems

Reference 24

Resolution: unresolved; no resolver link, observed 2026-08-04T10:57:25.710068Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation a947b19a-d10c-4efa-9264-fa8341bc9e86 · outbound

This paper cites On the tractable counting of theory models and its application to truth maintenance and belief revision.

On the Complexity of Language Membership for Probabilistic Words On the tractable counting of theory models and its application to truth maintenance and belief revision

Reference 25

Resolution: unresolved; no resolver link, observed 2026-08-04T10:57:25.750518Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation b5736a61-3a10-43c9-a833-0d41d0489e23 · outbound

This paper cites A knowledge compilation map.

On the Complexity of Language Membership for Probabilistic Words A knowledge compilation map

Reference 26

Resolution: unresolved; no resolver link, observed 2026-08-04T10:57:25.863726Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation e78f954d-f6bd-43fc-a551-04e6fb2600e3 · outbound

This paper cites On some combinatorial problems in free monoids.

On the Complexity of Language Membership for Probabilistic Words On some combinatorial problems in free monoids

Reference 27

Resolution: unresolved; no resolver link, observed 2026-08-04T10:57:25.963830Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation ce59efa3-d8b1-4826-9ac4-bc012a631f4b · outbound

This paper cites Some combinatorial properties of sturmian words.

On the Complexity of Language Membership for Probabilistic Words Some combinatorial properties of sturmian words

Reference 28

Resolution: unresolved; no resolver link, observed 2026-08-04T10:57:26.107331Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation d8b491ca-c77d-431a-baee-ca4bb77117a7 · outbound

This paper cites Unusual algorithms for lexicographical enumeration.

On the Complexity of Language Membership for Probabilistic Words Unusual algorithms for lexicographical enumeration

Reference 29

Resolution: unresolved; no resolver link, observed 2026-08-04T10:57:26.151355Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 7d9ffc3a-279c-4d71-a780-8c1068856be4 · outbound

This paper cites An efficient context-free parsing algorithm.

On the Complexity of Language Membership for Probabilistic Words An efficient context-free parsing algorithm

Reference 30

Resolution: unresolved; no resolver link, observed 2026-08-04T10:57:26.200751Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 998dae9c-9452-450b-97a4-596a25474ce3 · outbound

This paper cites PULPo: Probabilistic Unsupervised Laplacian Pyramid Registration.

On the Complexity of Language Membership for Probabilistic Words PULPo: Probabilistic Unsupervised Laplacian Pyramid Registration

Reference 31

Resolution: unresolved; no resolver link, observed 2026-08-04T10:57:26.309993Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 02cf43b4-3d59-4d6d-88d1-7d728d66a9ae · outbound

This paper cites Fischer, Albert R.

On the Complexity of Language Membership for Probabilistic Words Fischer, Albert R

Reference 32

Resolution: unresolved; no resolver link, observed 2026-08-04T10:57:26.389167Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 79cf9636-9848-4830-a6a2-0fce14801e9f · outbound

This paper cites Frid, Svetlana Puzynina, and Luca Q.

On the Complexity of Language Membership for Probabilistic Words Frid, Svetlana Puzynina, and Luca Q

Reference 33

Resolution: unresolved; no resolver link, observed 2026-08-04T10:57:26.471532Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation be523167-7d5c-44f1-913a-8d26738dee39 · outbound

This paper cites Deterministic context free languages.

On the Complexity of Language Membership for Probabilistic Words Deterministic context free languages

Reference 34

Resolution: unresolved; no resolver link, observed 2026-08-04T10:57:26.554990Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 44b578bb-ba59-4e99-a373-404abaf6ec20 · outbound

This paper cites Bounded algol-like languages.

On the Complexity of Language Membership for Probabilistic Words Bounded algol-like languages

Reference 35

Resolution: unresolved; no resolver link, observed 2026-08-04T10:57:26.613603Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 292a3ac7-2be0-4e9d-845f-f176618dfb34 · outbound

This paper cites Sweedyk, and Steve Mahaney.

On the Complexity of Language Membership for Probabilistic Words Sweedyk, and Steve Mahaney

Reference 36

Resolution: unresolved; no resolver link, observed 2026-08-04T10:57:26.662811Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation f27a8673-86fd-4d4e-b768-22108d426ba9 · outbound

This paper cites A note on undecidable properties of formal languages https://doi.org/10.1007/BF01691341.

On the Complexity of Language Membership for Probabilistic Words A note on undecidable properties of formal languages https://doi.org/10.1007/BF01691341

Reference 37

Resolution: verified exact; doi, observed 2026-08-04T10:58:19.024265Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation 672f39ca-9d17-4cad-95ac-16f25d81836d · outbound

This paper cites Greibach.

On the Complexity of Language Membership for Probabilistic Words Greibach

Reference 38

Resolution: unresolved; no resolver link, observed 2026-08-04T10:57:26.928443Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 682159a4-60c3-4cde-ab80-1b4499345bea · outbound

This paper cites On the Combinatorics of Palindromes and Antipalindromes.

On the Complexity of Language Membership for Probabilistic Words On the Combinatorics of Palindromes and Antipalindromes

Reference 39

Resolution: unresolved; no resolver link, observed 2026-08-04T10:57:27.037818Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation f17d5209-e48b-48db-956a-301b5278904e · outbound

This paper cites Hartmanis.

On the Complexity of Language Membership for Probabilistic Words Hartmanis

Reference 40

Resolution: unresolved; no resolver link, observed 2026-08-04T10:57:27.166938Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 70f41431-dca0-41ac-b36b-12d235cc06ff · outbound

This paper cites Hibbard and Joseph Ullian.

On the Complexity of Language Membership for Probabilistic Words Hibbard and Joseph Ullian

Reference 41

Resolution: unresolved; no resolver link, observed 2026-08-04T10:57:27.275606Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 07196bff-a41a-414b-a708-62c5ff1e8df8 · outbound

This paper cites Uniform random generation of strings in a context-free language.

On the Complexity of Language Membership for Probabilistic Words Uniform random generation of strings in a context-free language

Reference 42

Resolution: unresolved; no resolver link, observed 2026-08-04T10:57:27.408298Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation a29657f4-53b4-4142-b788-bf14cd9d09a4 · outbound

This paper cites Pumping lemmas for linear and nonlinear context-free languages.

On the Complexity of Language Membership for Probabilistic Words Pumping lemmas for linear and nonlinear context-free languages

Reference 43

Resolution: unresolved; no resolver link, observed 2026-08-04T10:57:27.550913Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 430013e8-6841-47a5-9eb3-90fd4f5df651 · outbound

This paper cites Strong interchangeability and nonlinearity of primitive words.

On the Complexity of Language Membership for Probabilistic Words Strong interchangeability and nonlinearity of primitive words

Reference 44

Resolution: unresolved; no resolver link, observed 2026-08-04T10:57:27.823704Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation d08f2642-7618-4ca1-8359-9a08c1c722b6 · outbound

This paper cites an unresolved cited work.

On the Complexity of Language Membership for Probabilistic Words Unresolved cited work

Reference 45

Resolution: unresolved; no resolver link, observed 2026-08-04T10:57:28.106023Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 13fb5049-8e52-41a6-b115-92bfafd32252 · outbound

This paper cites an unresolved cited work.

On the Complexity of Language Membership for Probabilistic Words Unresolved cited work

Reference 46

Resolution: unresolved; no resolver link, observed 2026-08-04T10:57:28.211696Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation bad7203c-acf0-4cce-b09a-462526295a96 · outbound

This paper cites A characterization of poly-slender context-free languages.

On the Complexity of Language Membership for Probabilistic Words A characterization of poly-slender context-free languages

Reference 47

Resolution: unresolved; no resolver link, observed 2026-08-04T10:57:28.344514Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 700a7208-956c-49f9-a9dd-cb055f425f59 · outbound

This paper cites Context-free languages and primitive words.

On the Complexity of Language Membership for Probabilistic Words Context-free languages and primitive words

Reference 48

Resolution: unresolved; no resolver link, observed 2026-08-04T10:57:28.475300Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 8490cb37-b985-4c63-b168-2600e453bdb5 · outbound

This paper cites Knowledge compilation meets database theory: Compiling queries to decision diagrams.

On the Complexity of Language Membership for Probabilistic Words Knowledge compilation meets database theory: Compiling queries to decision diagrams

Reference 49

Resolution: unresolved; no resolver link, observed 2026-08-04T10:57:28.591034Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 3193ed5d-4b1e-44a3-8138-4fd57d7ca227 · outbound

This paper cites Multidimensional trees and a C homsky- S ch \" u tzenberger- W eir representation theorem for simple context-free tree grammars.

On the Complexity of Language Membership for Probabilistic Words Multidimensional trees and a C homsky- S ch \" u tzenberger- W eir representation theorem for simple context-free tree grammars

Reference 50

Resolution: unresolved; no resolver link, observed 2026-08-04T10:57:28.724385Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 9ecea083-4b5a-4426-90fc-93e85168bf09 · outbound

This paper cites Kobele, Jens Michaelis, Sylvain Salvati, and Ryo Yoshinaka.

On the Complexity of Language Membership for Probabilistic Words Kobele, Jens Michaelis, Sylvain Salvati, and Ryo Yoshinaka

Reference 51

Resolution: unresolved; no resolver link, observed 2026-08-04T10:57:28.863868Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 46815bdd-8dcb-4ab0-9593-fd8187889157 · outbound

This paper cites Karp and Raymond E.

On the Complexity of Language Membership for Probabilistic Words Karp and Raymond E

Reference 52

Resolution: unresolved; no resolver link, observed 2026-08-04T10:57:28.976964Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 2153c322-a3be-4ee4-b606-41c9931d88ec · outbound

This paper cites an unresolved cited work.

On the Complexity of Language Membership for Probabilistic Words Unresolved cited work

Reference 53

Resolution: unresolved; no resolver link, observed 2026-08-04T10:57:29.106892Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 3cd83ece-6d25-417d-ad84-849beca681c7 · outbound

This paper cites A formal language perspective on factorized representations.

On the Complexity of Language Membership for Probabilistic Words A formal language perspective on factorized representations

Reference 54

Resolution: unresolved; no resolver link, observed 2026-08-04T10:57:29.247185Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 8ac1aa66-9328-4cb3-9677-6c0b1c64b748 · outbound

This paper cites Monadic second-order logics with cardinalities.

On the Complexity of Language Membership for Probabilistic Words Monadic second-order logics with cardinalities

Reference 55

Resolution: unresolved; no resolver link, observed 2026-08-04T10:57:29.414703Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 73cff5a3-ff5a-4fc5-a567-12ac5e788562 · outbound

This paper cites Knuth, James H.

On the Complexity of Language Membership for Probabilistic Words Knuth, James H

Reference 56

Resolution: unresolved; no resolver link, observed 2026-08-04T10:57:29.576745Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation fbcad8f5-eddb-44ca-b64c-bc4786047545 · outbound

This paper cites New analytic techniques for proving the inherent ambiguity of context-free languages.

On the Complexity of Language Membership for Probabilistic Words New analytic techniques for proving the inherent ambiguity of context-free languages

Reference 57

Resolution: unresolved; no resolver link, observed 2026-08-04T10:57:29.773942Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 15228241-cf15-46e0-916f-ac5bcb5167f6 · outbound

This paper cites An operational and denotational approach to non-context-freeness.

On the Complexity of Language Membership for Probabilistic Words An operational and denotational approach to non-context-freeness

Reference 58

Resolution: unresolved; no resolver link, observed 2026-08-04T10:57:29.949823Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 19885355-d0d9-45db-98b7-74b92085c6f6 · outbound

This paper cites an unresolved cited work.

On the Complexity of Language Membership for Probabilistic Words Unresolved cited work

Reference 59

Resolution: unresolved; no resolver link, observed 2026-08-04T10:57:30.065379Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 7a04363e-765e-47de-9033-e843d1d949b6 · outbound

This paper cites https://www.informaticadidactica.de/uploads/Artikel/LangeLeiss2009/LangeLeiss2009.pdf To CNF or not to CNF ? An efficient yet presentable version of the CYK algorithm.

On the Complexity of Language Membership for Probabilistic Words https://www.informaticadidactica.de/uploads/Artikel/LangeLeiss2009/LangeLeiss2009.pdf To CNF or not to CNF ? An efficient yet presentable version of the CYK algorithm

Reference 60

Resolution: unresolved; no resolver link, observed 2026-08-04T10:57:30.210077Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 6c773efe-4fdc-4090-b8d8-d856efdf519c · outbound

This paper cites an unresolved cited work.

On the Complexity of Language Membership for Probabilistic Words Unresolved cited work

Reference 61

Resolution: unresolved; no resolver link, observed 2026-08-04T10:57:30.372477Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation db5988ea-e1bc-4ae2-adba-b6c36004b313 · outbound

This paper cites On lexicographic enumeration of regular and context-free languages.

On the Complexity of Language Membership for Probabilistic Words On lexicographic enumeration of regular and context-free languages

Reference 62

Resolution: unresolved; no resolver link, observed 2026-08-04T10:57:30.519551Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 4716a907-f897-4078-8c4c-bfc4b79549b2 · outbound

This paper cites Hard counting problems for partial words.

On the Complexity of Language Membership for Probabilistic Words Hard counting problems for partial words

Reference 63

Resolution: unresolved; no resolver link, observed 2026-08-04T10:57:30.572446Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 506bd300-a964-4c81-ada8-0abc409601ba · outbound

This paper cites #CFG and #DNNF admit FPRAS.

On the Complexity of Language Membership for Probabilistic Words #CFG and #DNNF admit FPRAS

Reference 64

Resolution: unresolved; no resolver link, observed 2026-08-04T10:57:30.705538Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 195df2bc-4b75-42e1-9fad-7dd5b7f5e982 · outbound

This paper cites A lower bound on unambiguous context free grammars via communication complexity.

On the Complexity of Language Membership for Probabilistic Words A lower bound on unambiguous context free grammars via communication complexity

Reference 65

Resolution: unresolved; no resolver link, observed 2026-08-04T10:57:30.810364Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation f35237af-f672-44b3-a582-39d1f8f5a3d2 · outbound

This paper cites Solving a special case of the intensional vs extensional conjecture in probabilistic databases.

On the Complexity of Language Membership for Probabilistic Words Solving a special case of the intensional vs extensional conjecture in probabilistic databases

Reference 66

Resolution: unresolved; no resolver link, observed 2026-08-04T10:57:30.901474Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation c12e5f92-5dc3-4684-a20e-9d95294ff351 · outbound

This paper cites Lecture notes on automata, languages, and grammars, 2012.

On the Complexity of Language Membership for Probabilistic Words Lecture notes on automata, languages, and grammars, 2012

Reference 67

Resolution: unresolved; no resolver link, observed 2026-08-04T10:57:30.932509Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 7fd5dfeb-a480-4f8c-a9cd-01a04cdef38a · outbound

This paper cites Unambiguous boolean grammars.

On the Complexity of Language Membership for Probabilistic Words Unambiguous boolean grammars

Reference 68

Resolution: unresolved; no resolver link, observed 2026-08-04T10:57:30.989598Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation d3541250-4492-4e17-bffd-3e5214879a56 · outbound

This paper cites Conjunctive and boolean grammars: T he true general case of the context-free grammars.

On the Complexity of Language Membership for Probabilistic Words Conjunctive and boolean grammars: T he true general case of the context-free grammars

Reference 69

Resolution: unresolved; no resolver link, observed 2026-08-04T10:57:31.054454Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 1df4fd2f-8515-45aa-bebf-d7fedbff84ee · outbound

This paper cites The ambiguity of primitive words.

On the Complexity of Language Membership for Probabilistic Words The ambiguity of primitive words

Reference 70

Resolution: unresolved; no resolver link, observed 2026-08-04T10:57:31.128777Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 869f1e10-b529-46fc-819b-53c0b09f8885 · outbound

This paper cites New compilation languages based on structured decomposability.

On the Complexity of Language Membership for Probabilistic Words New compilation languages based on structured decomposability

Reference 71

Resolution: unresolved; no resolver link, observed 2026-08-04T10:57:31.206427Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 80399a0a-80df-4e79-a20e-e8f530525fa8 · outbound

This paper cites e l Fijalkow. The universality problem for automata with bounded ambiguity. “Games Automata Play.

On the Complexity of Language Membership for Probabilistic Words e l Fijalkow. The universality problem for automata with bounded ambiguity. “Games Automata Play

Reference 72

Resolution: unresolved; no resolver link, observed 2026-08-04T10:57:31.295317Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation c719c079-1472-42a7-b7b3-14f3794dd693 · outbound

This paper cites an unresolved cited work.

On the Complexity of Language Membership for Probabilistic Words Unresolved cited work

Reference 73

Resolution: unresolved; no resolver link, observed 2026-08-04T10:57:31.329475Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 34be34c1-6015-4b37-a7f8-639d71f7fea7 · outbound

This paper cites Deciding equivalence of finite tree automata.

On the Complexity of Language Membership for Probabilistic Words Deciding equivalence of finite tree automata

Reference 74

Resolution: unresolved; no resolver link, observed 2026-08-04T10:57:31.484541Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 74c96db5-69ff-414c-9dac-005a2affff56 · outbound

This paper cites On multiple context-free grammars.

On the Complexity of Language Membership for Probabilistic Words On multiple context-free grammars

Reference 75

Resolution: unresolved; no resolver link, observed 2026-08-04T10:57:31.559397Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 656a670e-b492-419d-a063-c4dee77b14d2 · outbound

This paper cites Generation of all the balanced parenthesis strings in lexicographical order.

On the Complexity of Language Membership for Probabilistic Words Generation of all the balanced parenthesis strings in lexicographical order

Reference 76

Resolution: unresolved; no resolver link, observed 2026-08-04T10:57:31.691932Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 11f28125-be25-4465-83f1-0119ed5e14a5 · outbound

This paper cites A second course in formal languages and automata theory.

On the Complexity of Language Membership for Probabilistic Words A second course in formal languages and automata theory

Reference 77

Resolution: unresolved; no resolver link, observed 2026-08-04T10:57:31.760810Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 234dd14c-011b-484e-9ffd-0da2553d7bd9 · outbound

This paper cites Some inherently ambiguous context-free languages.

On the Complexity of Language Membership for Probabilistic Words Some inherently ambiguous context-free languages

Reference 78

Resolution: unresolved; no resolver link, observed 2026-08-04T10:57:31.881771Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 90273acf-846b-4e9a-a0ae-de11f1e8eeab · outbound

This paper cites Hunt III.

On the Complexity of Language Membership for Probabilistic Words Hunt III

Reference 79

Resolution: unresolved; no resolver link, observed 2026-08-04T10:57:32.066693Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation f1584c0c-04d8-4a13-9767-fb9a7eae3d1c · outbound

This paper cites Suciu, D.

On the Complexity of Language Membership for Probabilistic Words Suciu, D

Reference 80

Resolution: unresolved; no resolver link, observed 2026-08-04T10:57:32.211315Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation c84f5d45-e9ae-4d89-bf14-42c5e9b420ce · outbound

This paper cites an unresolved cited work.

On the Complexity of Language Membership for Probabilistic Words Unresolved cited work

Reference 81

Resolution: unresolved; no resolver link, observed 2026-08-04T10:57:32.368723Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation f0065bfb-e23c-4dc0-b378-f7867df2bb65 · outbound

This paper cites an unresolved cited work.

On the Complexity of Language Membership for Probabilistic Words Unresolved cited work

Reference 82

Resolution: unresolved; no resolver link, observed 2026-08-04T10:57:32.533568Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 667ab384-027e-47bc-8139-fcd52803bf60 · outbound

This paper cites Valiant and Michael S.

On the Complexity of Language Membership for Probabilistic Words Valiant and Michael S

Reference 83

Resolution: unresolved; no resolver link, observed 2026-08-04T10:57:32.682870Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 91a2c136-5b23-45e0-b160-1dd28fe7a11a · outbound

This paper cites an unresolved cited work.

On the Complexity of Language Membership for Probabilistic Words Unresolved cited work

Reference 84

Resolution: unresolved; no resolver link, observed 2026-08-04T10:57:32.817890Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 2f702df9-b703-41ae-9357-91b656f25c4c · outbound

This paper cites Structured d-DNNF is not closed under negation.

On the Complexity of Language Membership for Probabilistic Words Structured d-DNNF is not closed under negation

Reference 85

Resolution: unresolved; no resolver link, observed 2026-08-04T10:57:32.937763Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation dbe2db4f-f7a0-4c62-b80d-b142a6b15f70 · outbound

This paper cites Ambiguity functions of context-free grammars and languages.

On the Complexity of Language Membership for Probabilistic Words Ambiguity functions of context-free grammars and languages

Reference 86

Resolution: unresolved; no resolver link, observed 2026-08-04T10:57:33.053632Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Coverage vector

Reference resolution

Outbound references

Pith citing papers