scientific article; zbMATH DE number 6146466

DOI10.4230/LIPIcs.STACS.2008.1354zbMath1259.68107MaRDI QIDQ4910730

Wouter Gelade, Frank Neven

Publication date: 19 March 2013

Full work available at URL: http://subs.emis.de/LIPIcs/frontdoor_a404.html

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

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45)

Related Items (17)

Nominal Kleene Coalgebra ⋮ Deciding determinism of caterpillar expressions ⋮ Functional Specification of Hardware via Temporal Logic ⋮ Series parallel digraphs with loops ⋮ The tractability frontier for NFA minimization ⋮ Finite Automata, Digraph Connectivity, and Regular Expression Size ⋮ Acyclic automata and small expressions using multi-tilde-bar operators ⋮ Provably Shorter Regular Expressions from Deterministic Finite Automata ⋮ Succinctness of pattern-based schema languages for XML ⋮ Language operations with regular expressions of polynomial size ⋮ Succinctness of regular expressions with interleaving, intersection and counting ⋮ Natural strategic ability ⋮ Multi-tilde Operators and Their Glushkov Automata ⋮ Tight Bounds on the Descriptional Complexity of Regular Expressions ⋮ Short Regular Expressions from Finite Automata: Empirical Results ⋮ Small Extended Expressions for Acyclic Automata ⋮ On the State Complexity of Partial Derivative Automata For Regular Expressions with Intersection

This page was built for publication: