Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
New item
Special pages
In other projects
MaRDI portal item
Discussion
View source
View history
English
Log in

scientific article; zbMATH DE number 3519903

From MaRDI portal
Publication:4098669
Jump to:navigation, search

zbMATH Open0332.68056MaRDI QIDQ4098669FDOQ4098669


Authors: Janusz Brzozowski Edit this on Wikidata


Publication date: 1975


Full work available at URL: http://www.numdam.org/item?id=SD_1974-1975__28_1_A13_0

Title of this publication is not available (Why is that?)




Mathematics Subject Classification ID

Formal languages and automata (68Q45)



Cited In (3)

  • Some complexity results for polynomial rational expressions.
  • Circuit complexity of regular languages
  • Efficiency of automata in semi-commutation verification techniques





This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4098669)

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:4098669&oldid=17862867"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 6 February 2024, at 06:52. Warning: Page may not contain recent updates.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki