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

Functional schemas with nested predicates

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

DOI10.1016/S0019-9958(75)90175-8zbMATH Open0302.68097OpenAlexW2167358968MaRDI QIDQ4057636FDOQ4057636


Authors: Zvi Galil Edit this on Wikidata


Publication date: 1975

Published in: Information and Control (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0019-9958(75)90175-8





Mathematics Subject Classification ID

Formal languages and automata (68Q45) Algorithms in computer science (68W99)



Cited In (4)

  • A direct algorithm for checking equivalence of LL(k) grammars
  • The complexity of monadic recursion schemes: executability problems, nesting depth, and applications
  • The complexity of monadic recursion schemes: Exponential time bounds
  • Monadic recursion schemes: The effect of constants





This page was built for publication: Functional schemas with nested predicates

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

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