A pattern logic for automata with outputs

DOI10.1142/S0129054120410038MaRDI QIDQ5859645zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

model checkingautomatalogicsstructural patterns

Mathematics Subject Classification ID

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)

Recommendations

• A pattern logic for automata with outputs
• scientific article; zbMATH DE number 5872401
• Pebble weighted automata and transitive closure logics
• Quantitative Monadic Second-Order Logic
• Weighted automata and weighted logics

Cites work

• scientific article; zbMATH DE number 3978420 (Why is no real title available?)
• scientific article; zbMATH DE number 3660804 (Why is no real title available?)
• scientific article; zbMATH DE number 2038747 (Why is no real title available?)
• scientific article; zbMATH DE number 2040319 (Why is no real title available?)
• scientific article; zbMATH DE number 3408928 (Why is no real title available?)
• A note on finite-valued and finitely ambiguous transducers
• A pattern logic for automata with outputs
• Complexity of Subcases of Presburger Arithmetic
• Decomposing Finite-Valued Transducers and Deciding Their Equivalence
• Degree of sequentiality of weighted automata
• Determinization of transducers over finite and infinite words.
• Economy of description for single-valued transducers
• Finite-valued weighted automata
• General algorithms for testing the ambiguity of finite automata and the double-tape ambiguity of finite-state transducers
• Lexicographic decomposition of \(k\)-valued transducers
• Multi-sequential word relations
• On the Decidability of Bounded Valuedness for Transducers
• On the Equivalence and Containment Problems for Unambiguous Regular Expressions, Regular Grammars and Finite Automata
• On the degree of ambiguity of finite automata
• On the valuedness of finite transducers
• Path logics for querying graphs: combining expressiveness and efficiency
• Quantitative languages defined by functional automata
• Squaring transducers: An efficient procedure for deciding functionality and sequentiality.
• The unsolvability of the Equivalence Problem for Λ-Free nondeterministic generalized machines
• Unambiguous automata denoting finitely sequential functions
• Une caractérisation des fonctions séquentielles et des fonctions sous- séquentielles en tant que rélations rationnelles

Cited in

(1)

• A pattern logic for automata with outputs

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)