scientific article; zbMATH DE number 1346517

MaRDI QIDQ4266541zbMATH OpenFDO

Authors Jürgen Dassow, Klaus-Jörn Lange

Publication date 3 October 1999

Mathematics Subject Classification ID

Automata and formal grammars in connection with logical questions (03D05) Complexity of computation (including implicit computational complexity) (03D15) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Cited in

(5)

• Rational subsets of polycyclic monoids and valence automata
• Multi-head finite automata: Data-independent versus data-dependent computations
• Principal abstract families of weighted tree languages
• Extending regular expressions with homomorphic replacement
• The emptiness problem for intersections of regular languages

This page was built for publication:

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