Publication:4910730
From MaRDI portal
DOI10.4230/LIPIcs.STACS.2008.1354zbMath1259.68107MaRDI QIDQ4910730
Publication date: 19 March 2013
Full work available at URL: http://subs.emis.de/LIPIcs/frontdoor_a404.html
Related Items
Series parallel digraphs with loops, The tractability frontier for NFA minimization, Succinctness of pattern-based schema languages for XML, Deciding determinism of caterpillar expressions, Succinctness of regular expressions with interleaving, intersection and counting, Acyclic automata and small expressions using multi-tilde-bar operators, Language operations with regular expressions of polynomial size, Natural strategic ability, On the State Complexity of Partial Derivative Automata For Regular Expressions with Intersection, Functional Specification of Hardware via Temporal Logic, Nominal Kleene Coalgebra, Finite Automata, Digraph Connectivity, and Regular Expression Size, Provably Shorter Regular Expressions from Deterministic Finite Automata, 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
