The following pages link to Andreas Maletti (Q519890):
Displaying 50 items.
- Parallel learning of automatic classes of languages (Q329605) (← links)
- Learning Boolean halfspaces with small weights from membership queries (Q329608) (← links)
- Forward and backward application of symbolic tree transducers (Q404011) (← links)
- On restricted context-free grammars (Q414885) (← links)
- Normality and automata (Q494059) (← links)
- The dual equivalence of equations and coequations for automata (Q498397) (← links)
- On the state complexity of operations on two-way finite automata (Q515574) (← links)
- Synthesis of deterministic top-down tree transducers from automatic tree relations (Q515670) (← links)
- Composition closure of linear extended top-down tree transducers (Q519891) (← links)
- Hasse diagrams for classes of deterministic bottom-up tree-to-tree-series transformations (Q557898) (← links)
- MAT learners for tree series: an abstract data type and two realizations (Q766165) (← links)
- On normality in shifts of finite type (Q778523) (← links)
- Input strictly local tree transducers (Q782595) (← links)
- Compositions of constant weighted extended tree transducers (Q832923) (← links)
- Backward and forward bisimulation minimization of tree automata (Q840778) (← links)
- Compositions of tree series transformations (Q860891) (← links)
- Prefix-free languages: left and right quotient and reversal (Q896681) (← links)
- Compositions of extended top-down tree transducers (Q948090) (← links)
- Extended multi bottom-up tree transducers (Q1038420) (← links)
- Minimizing deterministic weighted tree automata (Q1041045) (← links)
- On automata recognizing birecurrent sets (Q1625603) (← links)
- Decision problems of tree transducers with origin (Q1641005) (← links)
- Multiple context-free tree grammars and multi-component tree adjoining grammars (Q1679974) (← links)
- Decidable and expressive classes of probabilistic automata (Q1740668) (← links)
- Multiple context-free tree grammars: lexicalization and characterization (Q1749480) (← links)
- Supervised learning with quantum computers (Q1793976) (← links)
- An \(n\log n\) algorithm for hyper-minimizing a (minimized) deterministic automaton (Q1959648) (← links)
- On the degrees of non-regularity and non-context-freeness (Q2009649) (← links)
- Automatic learning from positive data and negative counterexamples (Q2013555) (← links)
- Aggregation-based minimization of finite state automata (Q2035006) (← links)
- The tree-generative capacity of combinatory categorial grammars (Q2051866) (← links)
- Determinisability of unary weighted automata over the rational numbers (Q2055977) (← links)
- Ambiguity hierarchies for weighted tree automata (Q2117674) (← links)
- Tree automata and pigeonhole classes of matroids. I (Q2149094) (← links)
- Weighted tree automata with constraints (Q2164002) (← links)
- An algorithm for computing coefficients of words in expressions involving exponentials and its application to the construction of exponential integrators (Q2175578) (← links)
- Composition closure of linear weighted extended top-down tree transducers (Q2177605) (← links)
- Transducer degrees: atoms, infima and suprema (Q2182680) (← links)
- Learning weighted automata over principal ideal domains (Q2200852) (← links)
- A Kleene theorem for weighted tree automata over distributive multioperator monoids (Q2272217) (← links)
- A Kleene theorem for weighted tree automata over tree valuation monoids (Q2280327) (← links)
- Linear context-free tree languages and inverse homomorphisms (Q2280337) (← links)
- Computing lower rank approximations of matrix polynomials (Q2284958) (← links)
- Hyper-optimization for deterministic tree automata (Q2344747) (← links)
- An almost-confluent congruential language which is not Church-Rosser congruential (Q2346383) (← links)
- Improved normal form for grammars with one-sided contexts (Q2348260) (← links)
- Survey: finite-state technology in natural language processing (Q2357102) (← links)
- The chop of languages (Q2358686) (← links)
- Between primitive and 2-transitive: synchronization and its friends (Q2412925) (← links)
- On the orbit of closure-involution operations -- the case of formal languages (Q2422027) (← links)
