More Concise Representation of Regular Languages by Automata and Regular Expressions

DOI10.1007/978-3-540-85780-8_28zbMath1161.68529OpenAlexW2186680946MaRDI QIDQ3533024

Carlo Mereghetti, Viliam Geffert, Beatrice Palano

Publication date: 30 October 2008

Published in: Developments in Language Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-85780-8_28

zbMATH Keywords

regular expressionspushdown automatadescriptional complexitystraight line programs

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• Complexity measures for regular expressions
• Regular expressions into finite automata
• Characterization of Glushkov automata
• Alternation
• Regularity and Related Problems for Deterministic Pushdown Automata
• Probabilistic automata
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: More Concise Representation of Regular Languages by Automata and Regular Expressions