A pattern logic for automata with outputs
DOI10.1142/S0129054120410038zbMATH Open1458.68097OpenAlexW3092165010MaRDI QIDQ5859645FDOQ5859645
Authors: Emmanuel Filiot, Nicolas Mazzocchi, Jean-François Raskin 
Publication date: 19 April 2021
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0129054120410038
Recommendations
Formal languages and automata (68Q45) Analysis of algorithms and problem complexity (68Q25) Specification and verification (program logics, model checking, etc.) (68Q60) Logic in computer science (03B70)
Cites Work
- On the valuedness of finite transducers
- Lexicographic decomposition of \(k\)-valued transducers
- On the Decidability of Bounded Valuedness for Transducers
- Title not available (Why is that?)
- On the Equivalence and Containment Problems for Unambiguous Regular Expressions, Regular Grammars and Finite Automata
- Title not available (Why is that?)
- A note on finite-valued and finitely ambiguous transducers
- Decomposing Finite-Valued Transducers and Deciding Their Equivalence
- Title not available (Why is that?)
- The unsolvability of the Equivalence Problem for Λ-Free nondeterministic generalized machines
- Title not available (Why is that?)
- Une caractérisation des fonctions séquentielles et des fonctions sous- séquentielles en tant que rélations rationnelles
- Path Logics for Querying Graphs: Combining Expressiveness and Efficiency
- On the degree of ambiguity of finite automata
- Determinization of transducers over finite and infinite words.
- Title not available (Why is that?)
- Squaring transducers: An efficient procedure for deciding functionality and sequentiality.
- Economy of description for single-valued transducers
- Complexity of Subcases of Presburger Arithmetic
- Unambiguous Automata Denoting Finitely Sequential Functions
- A pattern logic for automata with outputs
- Quantitative Languages Defined by Functional Automata
- Finite-Valued Weighted Automata.
- Degree of Sequentiality of Weighted Automata
- General algorithms for testing the ambiguity of finite automata and the double-tape ambiguity of finite-state transducers
- Multi-Sequential Word Relations
This page was built for publication: A pattern logic for automata with outputs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5859645)
