STACS 2004

DOI10.1007/B96012zbMATH Open1122.68467OpenAlexW4236485840MaRDI QIDQ5309709FDOQ5309709

Authors: Daniel Kirsten 

Publication date: 1 October 2007

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

Full work available at URL: https://doi.org/10.1007/b96012

Recommendations

• scientific article; zbMATH DE number 7168170
• Foundations of Software Science and Computation Structures
• Distance desert automata and star height substitutions.
• Descriptional and computational complexity of finite automata -- a survey
• scientific article; zbMATH DE number 2068876
• Descriptional and Computational Complexity of Finite Automata
• On finite automata with limited nondeterminism (extended abstract)
• On the homomorphisms of strongly connected finite automata into substitution automata
• scientific article; zbMATH DE number 1484314
• scientific article; zbMATH DE number 1746429

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cited In (6)

• The View Selection Problem for Regular Path Queries
• Distance desert automata and the star height problem
• Finite transducers and rational transductions
• Title not available (Why is that?)
• Distance desert automata and star height substitutions.
• A Burnside approach to the finite substitution problem

This page was built for publication: STACS 2004

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