Matches in DBpedia 2016-04 for { <http://dbpedia.org/resource/Star_height_problem> ?p ?o }
Showing triples 1 to 56 of
56
with 100 triples per page.
- Star_height_problem abstract "The star height problem in formal language theory is the question whether all regular languages can be expressed using regular expressions of limited star height, i.e. with a limited nesting depth of Kleene stars. Specifically, is a nesting depth of one always sufficient? If not, is there an algorithm to determine how many are required? The problem was raised by Eggan (1963).".
- Star_height_problem wikiPageExternalLink LATIN.pdf.
- Star_height_problem wikiPageExternalLink CS-80-03.pdf.
- Star_height_problem wikiPageID "27647".
- Star_height_problem wikiPageLength "8067".
- Star_height_problem wikiPageOutDegree "27".
- Star_height_problem wikiPageRevisionID "691329729".
- Star_height_problem wikiPageWikiLink Algorithm.
- Star_height_problem wikiPageWikiLink Alphabet_(formal_languages).
- Star_height_problem wikiPageWikiLink Cambridge_University_Press.
- Star_height_problem wikiPageWikiLink Category:Automata_(computation).
- Star_height_problem wikiPageWikiLink Category:Formal_languages.
- Star_height_problem wikiPageWikiLink Category:Theorems_in_discrete_mathematics.
- Star_height_problem wikiPageWikiLink Decimal.
- Star_height_problem wikiPageWikiLink Deterministic_finite_automaton.
- Star_height_problem wikiPageWikiLink ELEMENTARY.
- Star_height_problem wikiPageWikiLink EXPSPACE.
- Star_height_problem wikiPageWikiLink Formal_language.
- Star_height_problem wikiPageWikiLink Generalized_star_height_problem.
- Star_height_problem wikiPageWikiLink Information_and_Computation.
- Star_height_problem wikiPageWikiLink Kleene_star.
- Star_height_problem wikiPageWikiLink Kleenes_algorithm.
- Star_height_problem wikiPageWikiLink Kosaburo_Hashiguchi.
- Star_height_problem wikiPageWikiLink Michigan_Mathematical_Journal.
- Star_height_problem wikiPageWikiLink Nondeterministic_finite_automaton.
- Star_height_problem wikiPageWikiLink Observable_universe.
- Star_height_problem wikiPageWikiLink Permutation_automaton.
- Star_height_problem wikiPageWikiLink Recursive_definition.
- Star_height_problem wikiPageWikiLink Recursive_language.
- Star_height_problem wikiPageWikiLink Regular_expression.
- Star_height_problem wikiPageWikiLink Regular_language.
- Star_height_problem wikiPageWikiLink Star_height.
- Star_height_problem wikiPageWikiLinkText "Star height problem".
- Star_height_problem wikiPageWikiLinkText "star height problem".
- Star_height_problem wikiPageUsesTemplate Template:Cite_book.
- Star_height_problem wikiPageUsesTemplate Template:Cite_journal.
- Star_height_problem wikiPageUsesTemplate Template:Cite_paper.
- Star_height_problem wikiPageUsesTemplate Template:Harv.
- Star_height_problem wikiPageUsesTemplate Template:Harvtxt.
- Star_height_problem wikiPageUsesTemplate Template:Quotation.
- Star_height_problem subject Category:Automata_(computation).
- Star_height_problem subject Category:Formal_languages.
- Star_height_problem subject Category:Theorems_in_discrete_mathematics.
- Star_height_problem hypernym Question.
- Star_height_problem type Language.
- Star_height_problem type Work.
- Star_height_problem type Combinatoric.
- Star_height_problem type Language.
- Star_height_problem type Theorem.
- Star_height_problem comment "The star height problem in formal language theory is the question whether all regular languages can be expressed using regular expressions of limited star height, i.e. with a limited nesting depth of Kleene stars. Specifically, is a nesting depth of one always sufficient? If not, is there an algorithm to determine how many are required? The problem was raised by Eggan (1963).".
- Star_height_problem label "Star height problem".
- Star_height_problem sameAs Q7601219.
- Star_height_problem sameAs m.06wkv.
- Star_height_problem sameAs Q7601219.
- Star_height_problem wasDerivedFrom Star_height_problem?oldid=691329729.
- Star_height_problem isPrimaryTopicOf Star_height_problem.