Solving language equations using flanked automata

DOI10.1007/978-3-319-46520-3_7zbMATH Open1398.68293OpenAlexW2523518206MaRDI QIDQ1990504FDOQ1990504

Florent Avellaneda, Silvano Dal Zilio, Jean-Baptiste Raclet

Publication date: 25 October 2018

Full work available at URL: https://doi.org/10.1007/978-3-319-46520-3_7

Recommendations

• Language equations for timed alternating finite automata
• Publication:3490956
• Equations over finite sets of words and equivalence problems in automata theory
• scientific article; zbMATH DE number 1047888
• On a solving of algebraic equations systems associated with context-free languages
• scientific article; zbMATH DE number 3915631
• Maximal and minimal solutions to language equations
• Decision problems for language equations
• Language equations with complementation: decision problems
• On language equations with invertible operations

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cited In (1)

• Solutions to the involution language equation

This page was built for publication: Solving language equations using flanked automata

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1990504)