Pages that link to "Item:Q1824384"
From MaRDI portal
The following pages link to Membership problems for regular and context-free trace languages (Q1824384):
Displaying 20 items.
- Clique polynomials have a unique root of smallest modulus (Q294815) (← links)
- Parsing by matrix multiplication generalized to Boolean grammars (Q385966) (← links)
- Quantum finite automata: advances on Bertoni's ideas (Q517033) (← links)
- Efficient recognition of trace languages defined by repeat-until loops (Q989291) (← links)
- Theory of traces (Q1107296) (← links)
- Probabilistic estimation of the number of prefixes of a trace (Q1184996) (← links)
- Star-free trace languages (Q1193878) (← links)
- Asynchronous automata versus asynchronous cellular automata (Q1334661) (← links)
- Knapsack in graph groups (Q1702854) (← links)
- Realizability and verification of MSC graphs (Q1770427) (← links)
- The lattices of prefixes and overlaps of traces (Q1815323) (← links)
- Confluence problems for trace rewriting systems (Q1854457) (← links)
- Closure properties of knapsack semilinear groups (Q2236107) (← links)
- Deterministic pushdown-CD-systems of stateless deterministic R(1)-automata (Q2391861) (← links)
- An Automata-Theoretical Characterization of Context-Free Trace Languages (Q3075533) (← links)
- CD-systems of stateless deterministic R(1)-automata governed by an external pushdown store (Q3117547) (← links)
- Linear automata with translucent letters and linear context-free trace languages (Q3298123) (← links)
- Probabilistic asynchronous automata (Q4864443) (← links)
- On Restarting Automata with Window Size One (Q5200077) (← links)
- Preface (Q5898759) (← links)
