scientific article; zbMATH DE number 1948495

zbMath1015.68118MaRDI QIDQ4412108

Martin Kutrib, Markus Holzer

Publication date: 13 July 2003

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

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

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (14)

State complexity of combined operations ⋮ On the existence of prime decompositions ⋮ Operational state complexity of unary NFAs with finite nondeterminism ⋮ Descriptional complexity of limited automata ⋮ Nondeterministic state complexity of star-free languages ⋮ Finite transducers and nondeterministic state complexity of regular languages ⋮ Transition complexity of language operations ⋮ Lower bounds for the transition complexity of NFAs ⋮ On the descriptional complexity of finite automata with modified acceptance conditions ⋮ State complexity of some operations on binary regular languages ⋮ Complementing unary nondeterministic automata ⋮ Estimation of state complexity of combined operations ⋮ State complexity of basic operations on suffix-free regular languages ⋮ On Simulation Cost of Unary Limited Automata

This page was built for publication: