On canonical models for rational functions over infinite words
From MaRDI portal
Publication:5090969
DOI10.4230/LIPICS.FSTTCS.2018.30MaRDI QIDQ5090969FDOQ5090969
Authors: Emmanuel Filiot, Olivier Gauwin, Nathan Lhote, Anca Muscholl 
Publication date: 21 July 2022
Recommendations
Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Theory of computing (68Qxx)
Cites Work
- Minimization of Rational Word Functions
- Monadic second-order definable graph transductions: a survey
- On Relations Defined by Generalized Finite Automata
- On finite monoids having only trivial subgroups
- Title not available (Why is that?)
- A syntactic congruence for rational \(\omega\)-languages
- A combinatorial approach to the theory of ω-automata
- Unambiguous Büchi automata.
- Title not available (Why is that?)
- Star-free regular sets of ω-sequences
- Past, present, and infinite future
- Determinization of transducers over infinite words: The general case
- First-order definable languages
- Minimizing subsequential transducers: a survey.
- Two decidability problems for infinite words
- Automata and semigroups recognizing infinite words
- Note on: ``How to decide continuity of rational functions on infinite words
- Transducers with Origin Information
- Logical and algebraic characterizations of rational transductions
- Logic-automata connections for transformations
- Learning rational functions
- First-order definability of rational transductions: an algebraic approach
- Right-sequential functions on infinite words
- Title not available (Why is that?)
Cited In (1)
This page was built for publication: On canonical models for rational functions over infinite words
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5090969)
