bibliographer - Markus Holzer

bibliographer a curated TCS bibliography

obsidian
tags
authors
no doi
no pdf
bad author
add item
librarian

Finite Automata, Digraph Connectivity, and Regular Expression Size Hermann Gruber Markus Holzer [github]

Descriptional Complexity of (Un)ambiguous Finite State Machines and Pushdown Automata Markus Holzer Martin Kutrib [github]

Descriptional and computational complexity of finite automata---A survey Markus Holzer Martin Kutrib [github]

The size of Higman--Haines sets Hermann Gruber Markus Holzer Martin Kutrib [github]

More on the Size of Higman-Haines Sets: Effective Constructions Hermann Gruber Markus Holzer Martin Kutrib [github]

On timed automata with discrete time - structural and language theoretical characterization Hermann Gruber Markus Holzer Astrid Kiehn Barbara Kønig [github]

On deterministic finite automata and syntactic monoid size Markus Holzer Barbara König [github]

NONDETERMINISTIC DESCRIPTIONAL COMPLEXITY OF REGULAR LANGUAGES MARKUS HOLZER MARTIN KUTRIB [github]

From Finite Automata to Regular Expressions and Back - A Summary on Descriptional Complexity Hermann Gruber Markus Holzer [github]

Library Size: 13G (9 entries), Last Updated: Apr 04, 2026, 18:14:59, Build Time: N/A

[show logs] [hide logs]