◍wovepaper
SearchResearchersInstitutions
Sign in
institution

Knowledge Foundation

Sweden

1 paper here5 citations across 1
fields
  • cs.FL1
ROR 02cbq7e25OpenAlex

affiliations via OpenAlex

most citedFrom Finite Automata to Regular Expressions and Back--A Summary on Descriptional Complexity

5 citations

Showing cs.FLShow all

1 paper · 1 filter

cs.FL2014★ 5 cited

From Finite Automata to Regular Expressions and Back--A Summary on Descriptional Complexity

Hermann Gruber, Markus Holzer

The equivalence of finite automata and regular expressions dates back to the seminal paper of Kleene on events in nerve nets and finite automata from 1956. In the present paper we…

◍wovepaper

Papers, researchers and institutions, woven together.

Explore
  • Search
  • Researchers
  • Institutions
Account
  • Library
  • Chat
Data
  • arXiv.org
  • Semantic Scholar
  • OpenAlex
  • Latest RSS
AboutContactPrivacyDevelopersllms.txtopenapi.json
Not affiliated with arXiv. Researcher data from Semantic Scholar (ODC-BY) and OpenAlex.