Weighted automata and logics meet computational complexity
From MaRDI portal
Cites work
- A homomorphism theorem for weighted context-free grammars
- Algebraic systems and pushdown automata
- An ambiguity hierarchy of weighted context-free grammars
- Automata and rational expressions
- Characterizing the super-Turing computing power and efficiency of classical fuzzy Turing machines
- Closure properties and witness reduction
- Computational Complexity
- Computational Complexity
- Counting classes: Thresholds, parity, mods, and fewness
- Descriptive complexity for counting complexity classes
- Descriptive complexity for counting complexity classes
- Descriptive complexity of \#P functions: a new perspective
- Descriptive complexity of \(\#\)P functions
- Determinization of weighted finite automata over strong bimonoids
- Elements of automata theory. Translated from the French by Reuben Thomas
- Fuzzy algorithms
- Gap-definable counting classes
- Handbook of weighted automata
- scientific article; zbMATH DE number 3932372 (Why is no real title available?)
- scientific article; zbMATH DE number 3664335 (Why is no real title available?)
- scientific article; zbMATH DE number 3497806 (Why is no real title available?)
- scientific article; zbMATH DE number 3588051 (Why is no real title available?)
- scientific article; zbMATH DE number 1254648 (Why is no real title available?)
- scientific article; zbMATH DE number 1257742 (Why is no real title available?)
- scientific article; zbMATH DE number 610968 (Why is no real title available?)
- scientific article; zbMATH DE number 1358710 (Why is no real title available?)
- scientific article; zbMATH DE number 941396 (Why is no real title available?)
- scientific article; zbMATH DE number 3799016 (Why is no real title available?)
- scientific article; zbMATH DE number 798167 (Why is no real title available?)
- scientific article; zbMATH DE number 7561720 (Why is no real title available?)
- Infinite linear systems and one counter languages
- Lindenmayer systems
- Noncommutative rational series with applications
- On the computing power of fuzzy Turing machines
- On the definition of a family of automata
- On the power of parity polynomial time
- Qualitative relativizations of complexity classes
- Rational and Recognisable Power Series
- Semiring reasoning frameworks in AI and their computational complexity
- Semirings and Formal Power Series
- Strong lower bounds on the approximability of some NPO PB-complete maximization problems
- Structure in Approximation Classes
- Survey: finite-state technology in natural language processing
- The Chomsky-Schützenberger theorem for quantitative context-free languages
- The complexity of computing the permanent
- The Complexity of Enumeration and Reliability Problems
- The complexity of optimization problems
- The complexity of tensor calculus
- The complexity of tensor circuit evaluation
- Triangular norms
- Weak Second‐Order Arithmetic and Finite Automata
- Weighted automata
- Weighted automata and logics on graphs
- Weighted automata and weighted logics
- Weighted automata and weighted logics
- Weighted Automata and Weighted Logics with Discounting
- Weighted automata with storage
- Weighted finite automata over strong bimonoids
- Weighted logics for unranked tree automata
- Weighted tree automata and weighted logics
This page was built for publication: Weighted automata and logics meet computational complexity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6647756)
