Minimal automaton for a factorial, transitive, and rational language

DOI10.1016/0304-3975(89)90022-4zbMATH Open0679.68110OpenAlexW1972816315MaRDI QIDQ1822985FDOQ1822985

Danièle Beauquier

Publication date: 1989

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(89)90022-4

Recommendations

• scientific article; zbMATH DE number 826075
• scientific article; zbMATH DE number 1222602
• scientific article; zbMATH DE number 4035189
• La reconnaissance des facteurs d'un langage fini dans un texte en temps linéaire. (Recognition of the factors of a finite language in a text in linear time)
• Deciding WQO for factorial languages

zbMATH Keywords

finite automatasyntactic monoids

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Algebraic theory of languages and automata (68Q70)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Sofic systems and graphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (10)

• Sofic shifts with synchronizing presentations
• The size of power automata.
• Pseudovarieties defining classes of sofic subshifts closed under taking shift equivalent subshifts.
• REDUCED POWER AUTOMATA AND SOFIC SYSTEMS
• A hierarchy of shift equivalent sofic shifts
• A new algebraic invariant for weak equivalence of sofic subshifts
• Zeta Functions of Formal Languages
• A categorical invariant of flow equivalence of shifts
• THE SYNTACTIC GRAPH OF A SOFIC SHIFT IS INVARIANT UNDER SHIFT EQUIVALENCE
• CONJUGACY INVARIANTS OF SUBSHIFTS: AN APPROACH FROM PROFINITE SEMIGROUP THEORY

This page was built for publication: Minimal automaton for a factorial, transitive, and rational language

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