Computing the order of a locally testable automaton

DOI10.1007/3-540-54967-6_69MaRDI QIDQ4246720zbMATH OpenFDO

Authors Sam M. Kim, Robert McNaughton

Publication date 16 June 1999

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-54967-6_69

Mathematics Subject Classification ID

Algebraic theory of languages and automata (68Q70)

Cited in

(1)

• Algorithms finding the order of local testability of deterministic finite automaton and estimations of the order

This page was built for publication: Computing the order of a locally testable automaton

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