scientific article; zbMATH DE number 2040919

zbMATH Open1037.68098MaRDI QIDQ4452075

Barbara König, Markus Holzer

Publication date: 11 February 2004

Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2710/27100349.htm

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

deterministic finite automataregular languagestransformation semigroupssyntactic monoid

Mathematics Subject Classification ID

Algebraic theory of languages and automata (68Q70) Semigroups in automata theory, linguistics, etc. (20M35)

Related Items (2)

Unnamed Item ⋮ On deterministic finite automata and syntactic monoid size

Recommendations

• On deterministic finite automata and syntactic monoid size 👍 👎
• On the Capabilities of Grammars, Automata, and Transducers Controlled by Monoids 👍 👎
• DETERMINISTIC AUTOMATA AND THE MONADIC THEORY OF ORDINALS < ω2 👍 👎
• On finite automata with limited nondeterminism (extended abstract) 👍 👎
• Unnamed Item 👍 👎
• Unnamed Item 👍 👎
• Unnamed Item 👍 👎
• Unnamed Item 👍 👎
• Unnamed Item 👍 👎
• Unnamed Item 👍 👎

This page was built for publication: