Transducers with Origin Information
From MaRDI portal
Publication:5167824
DOI10.1007/978-3-662-43951-7_3zbMath1409.68152arXiv1309.6124OpenAlexW1810576301MaRDI QIDQ5167824
Publication date: 1 July 2014
Published in: Automata, Languages, and Programming (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1309.6124
Computational learning theory (68Q32) Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05) Semantics in the theory of computing (68Q55)
Related Items (21)
Provenance Circuits for Trees and Treelike Instances ⋮ Decision Problems of Tree Transducers with Origin ⋮ Linking theorems for tree transducers ⋮ Decision problems of tree transducers with origin ⋮ Inferring regular languages and \(\omega\)-languages ⋮ Deterministic Stack Transducers ⋮ A Circuit Complexity Approach to Transductions ⋮ Deciding origin equivalence of weakly self-nesting macro tree transducers ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Resynchronizing Classes of Word Relations ⋮ One-way resynchronizability of word transducers ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Regular \(\omega\)-languages with an informative right congruence ⋮ Regular Transformations of Data Words Through Origin Information ⋮ Origin-equivalence of two-way word transducers is in PSPACE ⋮ On Synthesis of Resynchronizers for Transducers ⋮ Learning algorithms ⋮ From Two-Way Transducers to Regular Function Expressions
This page was built for publication: Transducers with Origin Information
